./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ba31a8852254650e4ff6b6614669c496c01110f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:56:43,481 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:56:43,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:56:43,491 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:56:43,491 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:56:43,492 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:56:43,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:56:43,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:56:43,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:56:43,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:56:43,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:56:43,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:56:43,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:56:43,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:56:43,498 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:56:43,499 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:56:43,500 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:56:43,501 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:56:43,502 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:56:43,503 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:56:43,504 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:56:43,505 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:56:43,506 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:56:43,506 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:56:43,506 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:56:43,507 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:56:43,507 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:56:43,508 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:56:43,508 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:56:43,509 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:56:43,509 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:56:43,509 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:56:43,509 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:56:43,509 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:56:43,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:56:43,510 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:56:43,510 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-10 12:56:43,517 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:56:43,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:56:43,518 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:56:43,518 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 12:56:43,519 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 12:56:43,519 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 12:56:43,519 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 12:56:43,519 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 12:56:43,519 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 12:56:43,519 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 12:56:43,520 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 12:56:43,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:56:43,520 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:56:43,520 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:56:43,520 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:56:43,521 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:56:43,521 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:56:43,521 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:56:43,521 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:56:43,521 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:56:43,521 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 12:56:43,521 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:56:43,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:56:43,522 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:56:43,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:56:43,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:56:43,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:56:43,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:56:43,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:56:43,523 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:56:43,523 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:56:43,523 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:56:43,523 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 12:56:43,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:56:43,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:56:43,523 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 12:56:43,524 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ba31a8852254650e4ff6b6614669c496c01110f [2018-11-10 12:56:43,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:56:43,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:56:43,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:56:43,556 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:56:43,557 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:56:43,557 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/../../sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 12:56:43,595 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/data/e41f7e859/35c40ba3a56c44db9363d03693c85f58/FLAG4c36cc562 [2018-11-10 12:56:43,977 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:56:43,977 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 12:56:43,981 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/data/e41f7e859/35c40ba3a56c44db9363d03693c85f58/FLAG4c36cc562 [2018-11-10 12:56:43,991 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/data/e41f7e859/35c40ba3a56c44db9363d03693c85f58 [2018-11-10 12:56:43,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:56:43,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:56:43,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:56:43,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:56:43,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:56:43,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:43" (1/1) ... [2018-11-10 12:56:44,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:43, skipping insertion in model container [2018-11-10 12:56:44,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:56:43" (1/1) ... [2018-11-10 12:56:44,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:56:44,019 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:56:44,117 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:56:44,119 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:56:44,130 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:56:44,138 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:56:44,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44 WrapperNode [2018-11-10 12:56:44,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:56:44,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:56:44,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:56:44,139 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:56:44,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... [2018-11-10 12:56:44,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... [2018-11-10 12:56:44,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:56:44,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:56:44,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:56:44,153 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:56:44,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... [2018-11-10 12:56:44,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... [2018-11-10 12:56:44,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... [2018-11-10 12:56:44,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... [2018-11-10 12:56:44,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... [2018-11-10 12:56:44,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... [2018-11-10 12:56:44,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... [2018-11-10 12:56:44,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:56:44,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:56:44,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:56:44,168 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:56:44,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:56:44,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:56:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:56:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2018-11-10 12:56:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2018-11-10 12:56:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:56:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:56:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2018-11-10 12:56:44,246 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2018-11-10 12:56:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:56:44,247 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:56:44,420 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:56:44,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:44 BoogieIcfgContainer [2018-11-10 12:56:44,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:56:44,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:56:44,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:56:44,424 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:56:44,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:56:43" (1/3) ... [2018-11-10 12:56:44,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f12db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:44, skipping insertion in model container [2018-11-10 12:56:44,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:56:44" (2/3) ... [2018-11-10 12:56:44,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f12db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:56:44, skipping insertion in model container [2018-11-10 12:56:44,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:44" (3/3) ... [2018-11-10 12:56:44,427 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-10 12:56:44,435 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:56:44,442 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-10 12:56:44,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-10 12:56:44,483 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:56:44,483 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:56:44,484 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:56:44,484 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:56:44,484 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:56:44,484 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:56:44,484 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:56:44,484 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:56:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-10 12:56:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 12:56:44,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:44,507 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:44,509 INFO L424 AbstractCegarLoop]: === Iteration 1 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:44,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1198579965, now seen corresponding path program 1 times [2018-11-10 12:56:44,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:44,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:44,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:44,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:44,557 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:56:44,671 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:44,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:56:44,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:56:44,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:56:44,684 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-11-10 12:56:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:44,836 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2018-11-10 12:56:44,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:56:44,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-10 12:56:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:44,844 INFO L225 Difference]: With dead ends: 85 [2018-11-10 12:56:44,844 INFO L226 Difference]: Without dead ends: 35 [2018-11-10 12:56:44,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:56:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-10 12:56:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 12:56:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 12:56:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-10 12:56:44,875 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-11-10 12:56:44,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:44,876 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 12:56:44,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:56:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-10 12:56:44,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 12:56:44,877 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:44,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:44,878 INFO L424 AbstractCegarLoop]: === Iteration 2 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:44,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:44,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1198580189, now seen corresponding path program 1 times [2018-11-10 12:56:44,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:44,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:44,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:44,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:44,880 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:44,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:44,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 12:56:44,921 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:44,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 12:56:44,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:56:44,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:56:44,923 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-11-10 12:56:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:44,984 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-10 12:56:44,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:56:44,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-10 12:56:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:44,985 INFO L225 Difference]: With dead ends: 35 [2018-11-10 12:56:44,985 INFO L226 Difference]: Without dead ends: 33 [2018-11-10 12:56:44,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:56:44,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-10 12:56:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-10 12:56:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 12:56:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-10 12:56:44,990 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-11-10 12:56:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:44,990 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-10 12:56:44,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 12:56:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-10 12:56:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 12:56:44,991 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:44,991 INFO L375 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-10 12:56:44,992 INFO L424 AbstractCegarLoop]: === Iteration 3 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:44,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash -133594911, now seen corresponding path program 1 times [2018-11-10 12:56:44,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:44,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:44,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:44,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:44,996 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:45,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:45,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:45,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 12:56:45,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:45,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 12:56:45,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:56:45,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:56:45,061 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-10 12:56:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:45,183 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-10 12:56:45,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:56:45,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-10 12:56:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:45,185 INFO L225 Difference]: With dead ends: 45 [2018-11-10 12:56:45,185 INFO L226 Difference]: Without dead ends: 44 [2018-11-10 12:56:45,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:56:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-10 12:56:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-10 12:56:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 12:56:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-10 12:56:45,192 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-11-10 12:56:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:45,192 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-10 12:56:45,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 12:56:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-10 12:56:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 12:56:45,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:45,193 INFO L375 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-10 12:56:45,193 INFO L424 AbstractCegarLoop]: === Iteration 4 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:45,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash 153525098, now seen corresponding path program 1 times [2018-11-10 12:56:45,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:45,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:45,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:45,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:45,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:56:45,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:45,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:56:45,217 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:45,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:56:45,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:56:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:56:45,218 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-10 12:56:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:45,225 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-10 12:56:45,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:56:45,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-10 12:56:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:45,226 INFO L225 Difference]: With dead ends: 41 [2018-11-10 12:56:45,226 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 12:56:45,226 INFO L605 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-10 12:56:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 12:56:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-10 12:56:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-10 12:56:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-10 12:56:45,231 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 21 [2018-11-10 12:56:45,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:45,232 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-10 12:56:45,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:56:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-10 12:56:45,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 12:56:45,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:45,233 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:45,233 INFO L424 AbstractCegarLoop]: === Iteration 5 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:45,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash -124360313, now seen corresponding path program 1 times [2018-11-10 12:56:45,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:45,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:45,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:45,234 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:45,332 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-10 12:56:45,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:56:45,333 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:56:45,333 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-10 12:56:45,335 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [20], [27], [31], [49], [50], [54], [58], [61], [63], [77], [79], [80], [81], [87], [88], [89] [2018-11-10 12:56:45,374 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:56:45,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:56:45,489 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:56:45,490 INFO L272 AbstractInterpreter]: Visited 23 different actions 44 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-10 12:56:45,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:45,504 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:56:45,574 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 51.9% of their original sizes. [2018-11-10 12:56:45,575 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:56:45,785 INFO L415 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2018-11-10 12:56:45,785 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:56:45,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:56:45,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [10] total 25 [2018-11-10 12:56:45,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:45,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 12:56:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 12:56:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:56:45,787 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 17 states. [2018-11-10 12:56:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:46,498 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-10 12:56:46,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 12:56:46,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-10 12:56:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:46,499 INFO L225 Difference]: With dead ends: 65 [2018-11-10 12:56:46,499 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 12:56:46,500 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-11-10 12:56:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 12:56:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-11-10 12:56:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-10 12:56:46,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-10 12:56:46,506 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-11-10 12:56:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:46,506 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-10 12:56:46,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 12:56:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-10 12:56:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:56:46,509 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:46,509 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:46,510 INFO L424 AbstractCegarLoop]: === Iteration 6 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:46,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:46,510 INFO L82 PathProgramCache]: Analyzing trace with hash 901443614, now seen corresponding path program 1 times [2018-11-10 12:56:46,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:46,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:46,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:46,511 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:46,582 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-10 12:56:46,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:46,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 12:56:46,582 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:46,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 12:56:46,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 12:56:46,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 12:56:46,583 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 10 states. [2018-11-10 12:56:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:46,698 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-10 12:56:46,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:56:46,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-10 12:56:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:46,700 INFO L225 Difference]: With dead ends: 61 [2018-11-10 12:56:46,701 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 12:56:46,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-10 12:56:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 12:56:46,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-10 12:56:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 12:56:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2018-11-10 12:56:46,708 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 30 [2018-11-10 12:56:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:46,709 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-11-10 12:56:46,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 12:56:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-11-10 12:56:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 12:56:46,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:46,710 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:56:46,710 INFO L424 AbstractCegarLoop]: === Iteration 7 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:46,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1618804258, now seen corresponding path program 1 times [2018-11-10 12:56:46,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:46,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:46,711 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:46,762 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-10 12:56:46,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:46,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:56:46,763 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:46,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 12:56:46,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 12:56:46,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 12:56:46,764 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 9 states. [2018-11-10 12:56:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:46,850 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2018-11-10 12:56:46,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:56:46,850 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-10 12:56:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:46,851 INFO L225 Difference]: With dead ends: 75 [2018-11-10 12:56:46,851 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 12:56:46,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-10 12:56:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 12:56:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-11-10 12:56:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 12:56:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2018-11-10 12:56:46,858 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 30 [2018-11-10 12:56:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:46,859 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2018-11-10 12:56:46,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 12:56:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2018-11-10 12:56:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 12:56:46,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:46,860 INFO L375 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-10 12:56:46,860 INFO L424 AbstractCegarLoop]: === Iteration 8 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:46,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:46,861 INFO L82 PathProgramCache]: Analyzing trace with hash -602622204, now seen corresponding path program 1 times [2018-11-10 12:56:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:46,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:46,862 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:46,947 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-10 12:56:46,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:56:46,948 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:56:46,948 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-10 12:56:46,948 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [20], [27], [31], [32], [35], [37], [39], [41], [49], [50], [54], [58], [61], [63], [77], [79], [80], [81], [83], [84], [87], [88], [89] [2018-11-10 12:56:46,950 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:56:46,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:56:46,992 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:56:46,992 INFO L272 AbstractInterpreter]: Visited 30 different actions 88 times. Merged at 2 different actions 6 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 6 variables. [2018-11-10 12:56:47,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:47,008 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:56:47,047 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 55.07% of their original sizes. [2018-11-10 12:56:47,047 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:56:47,352 INFO L415 sIntCurrentIteration]: We unified 35 AI predicates to 35 [2018-11-10 12:56:47,353 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:56:47,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:56:47,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [11] total 32 [2018-11-10 12:56:47,353 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:47,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 12:56:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 12:56:47,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-11-10 12:56:47,354 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand 23 states. [2018-11-10 12:56:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:48,578 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2018-11-10 12:56:48,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 12:56:48,578 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-11-10 12:56:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:48,579 INFO L225 Difference]: With dead ends: 107 [2018-11-10 12:56:48,579 INFO L226 Difference]: Without dead ends: 84 [2018-11-10 12:56:48,580 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=1423, Unknown=0, NotChecked=0, Total=1640 [2018-11-10 12:56:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-10 12:56:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2018-11-10 12:56:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 12:56:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2018-11-10 12:56:48,588 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 36 [2018-11-10 12:56:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:48,588 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-10 12:56:48,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 12:56:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2018-11-10 12:56:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 12:56:48,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:48,590 INFO L375 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-10 12:56:48,590 INFO L424 AbstractCegarLoop]: === Iteration 9 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:48,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:48,590 INFO L82 PathProgramCache]: Analyzing trace with hash -965183292, now seen corresponding path program 1 times [2018-11-10 12:56:48,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:48,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:48,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:48,663 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-10 12:56:48,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:56:48,664 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:56:48,664 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-10 12:56:48,664 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [20], [27], [31], [32], [42], [44], [46], [48], [49], [50], [54], [58], [61], [63], [77], [79], [80], [81], [85], [86], [87], [88], [89] [2018-11-10 12:56:48,665 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:56:48,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:56:48,690 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:56:48,691 INFO L272 AbstractInterpreter]: Visited 30 different actions 88 times. Merged at 2 different actions 6 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 6 variables. [2018-11-10 12:56:48,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:48,696 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:56:48,719 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 55.07% of their original sizes. [2018-11-10 12:56:48,719 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:56:48,961 INFO L415 sIntCurrentIteration]: We unified 35 AI predicates to 35 [2018-11-10 12:56:48,961 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:56:48,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:56:48,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [11] total 33 [2018-11-10 12:56:48,961 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:48,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 12:56:48,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 12:56:48,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-11-10 12:56:48,962 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 24 states. [2018-11-10 12:56:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:50,205 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2018-11-10 12:56:50,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 12:56:50,205 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2018-11-10 12:56:50,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:50,206 INFO L225 Difference]: With dead ends: 104 [2018-11-10 12:56:50,206 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 12:56:50,207 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=1592, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 12:56:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 12:56:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-11-10 12:56:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 12:56:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-11-10 12:56:50,214 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 36 [2018-11-10 12:56:50,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:50,214 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-11-10 12:56:50,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 12:56:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-11-10 12:56:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 12:56:50,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:50,216 INFO L375 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-10 12:56:50,216 INFO L424 AbstractCegarLoop]: === Iteration 10 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:50,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash -389020223, now seen corresponding path program 1 times [2018-11-10 12:56:50,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:50,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:50,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:50,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:50,319 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-10 12:56:50,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:56:50,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 12:56:50,319 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:50,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 12:56:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:56:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:56:50,320 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 11 states. [2018-11-10 12:56:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:50,446 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-10 12:56:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 12:56:50,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-11-10 12:56:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:50,447 INFO L225 Difference]: With dead ends: 81 [2018-11-10 12:56:50,447 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 12:56:50,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-10 12:56:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 12:56:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-10 12:56:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 12:56:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-11-10 12:56:50,456 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 40 [2018-11-10 12:56:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:50,456 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-11-10 12:56:50,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 12:56:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-11-10 12:56:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 12:56:50,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:50,457 INFO L375 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-10 12:56:50,457 INFO L424 AbstractCegarLoop]: === Iteration 11 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:50,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1126316441, now seen corresponding path program 1 times [2018-11-10 12:56:50,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:50,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:50,458 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:50,550 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-10 12:56:50,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:56:50,550 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:56:50,551 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-10 12:56:50,551 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [20], [27], [31], [32], [35], [37], [39], [41], [42], [44], [46], [48], [49], [50], [54], [58], [61], [63], [77], [79], [80], [81], [83], [84], [85], [86], [87], [88], [89] [2018-11-10 12:56:50,552 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 12:56:50,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 12:56:50,696 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 12:56:50,697 INFO L272 AbstractInterpreter]: Visited 36 different actions 665 times. Merged at 3 different actions 72 times. Never widened. Found 75 fixpoints after 6 different actions. Largest state had 7 variables. [2018-11-10 12:56:50,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:50,701 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 12:56:50,725 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 56.46% of their original sizes. [2018-11-10 12:56:50,725 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 12:56:51,117 INFO L415 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2018-11-10 12:56:51,117 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 12:56:51,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:56:51,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [12] total 40 [2018-11-10 12:56:51,117 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 12:56:51,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-10 12:56:51,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 12:56:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2018-11-10 12:56:51,118 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 30 states. [2018-11-10 12:56:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:53,973 INFO L93 Difference]: Finished difference Result 176 states and 213 transitions. [2018-11-10 12:56:53,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-10 12:56:53,973 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-11-10 12:56:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:53,974 INFO L225 Difference]: With dead ends: 176 [2018-11-10 12:56:53,974 INFO L226 Difference]: Without dead ends: 146 [2018-11-10 12:56:53,976 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 85 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=634, Invalid=4196, Unknown=0, NotChecked=0, Total=4830 [2018-11-10 12:56:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-10 12:56:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 123. [2018-11-10 12:56:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 12:56:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2018-11-10 12:56:53,991 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 46 [2018-11-10 12:56:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:53,991 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2018-11-10 12:56:53,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-10 12:56:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2018-11-10 12:56:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 12:56:53,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:56:53,992 INFO L375 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-10 12:56:53,992 INFO L424 AbstractCegarLoop]: === Iteration 12 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 12:56:53,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:56:53,992 INFO L82 PathProgramCache]: Analyzing trace with hash -971418585, now seen corresponding path program 2 times [2018-11-10 12:56:53,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 12:56:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:53,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:56:53,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:56:53,993 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 12:56:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:56:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 12:56:54,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:56:54,116 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 12:56:54,116 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 12:56:54,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 12:56:54,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:56:54,117 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:56:54,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:56:54,124 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 12:56:54,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 12:56:54,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:56:54,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:56:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 12:56:54,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 12:56:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 12:56:54,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 12:56:54,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 35 [2018-11-10 12:56:54,767 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 12:56:54,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 12:56:54,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 12:56:54,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 12:56:54,767 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 27 states. [2018-11-10 12:56:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:56:55,204 INFO L93 Difference]: Finished difference Result 145 states and 176 transitions. [2018-11-10 12:56:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 12:56:55,205 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 46 [2018-11-10 12:56:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:56:55,205 INFO L225 Difference]: With dead ends: 145 [2018-11-10 12:56:55,205 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:56:55,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 69 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2018-11-10 12:56:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:56:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:56:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:56:55,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:56:55,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-11-10 12:56:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:56:55,207 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:56:55,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 12:56:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:56:55,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:56:55,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:56:55,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 12:56:55,537 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 21 [2018-11-10 12:56:55,801 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 44 [2018-11-10 12:56:56,120 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 44 [2018-11-10 12:56:56,135 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 12:56:56,135 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:56:56,135 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2018-11-10 12:56:56,135 INFO L425 ceAbstractionStarter]: For program point dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2018-11-10 12:56:56,135 INFO L425 ceAbstractionStarter]: For program point dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2018-11-10 12:56:56,135 INFO L425 ceAbstractionStarter]: For program point dividesFINAL(lines 30 38) no Hoare annotation was computed. [2018-11-10 12:56:56,135 INFO L425 ceAbstractionStarter]: For program point dividesEXIT(lines 30 38) no Hoare annotation was computed. [2018-11-10 12:56:56,135 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 12:56:56,135 INFO L425 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-11-10 12:56:56,135 INFO L428 ceAbstractionStarter]: At program point dividesENTRY(lines 30 38) the Hoare annotation is: true [2018-11-10 12:56:56,135 INFO L421 ceAbstractionStarter]: At program point L37-2(line 37) the Hoare annotation is: (let ((.cse0 (< |divides_#in~n| 1))) (and (or .cse0 (and (<= divides_~m 2147483647) (<= divides_~n divides_~m) (<= 1 divides_~n)) (< 2147483647 |divides_#in~m|)) (or (< 2147483646 |divides_#in~m|) (<= divides_~m 2147483646) .cse0))) [2018-11-10 12:56:56,135 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point L37-3(line 37) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:56:56,136 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point gcdEXIT(lines 15 27) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point gcdFINAL(lines 15 27) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L421 ceAbstractionStarter]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse3 (* 2 |gcd_#in~y2|)) (.cse1 (* 2 |gcd_#in~y1|)) (.cse0 (< 2147483647 |gcd_#in~y2|))) (and (or (< 2147483647 |gcd_#in~y1|) (and (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1)) .cse0) (or (< 4294967294 .cse1) (let ((.cse2 (+ gcd_~y2 gcd_~y1))) (and (<= 3 .cse2) (<= gcd_~y1 gcd_~y2) (<= .cse2 4294967293))) (< 4294967294 .cse3)) (or (< 4294967292 .cse3) (< 4294967292 .cse1) (<= (* 2 gcd_~y1) 4294967290)) (or (< 4294967290 .cse1) (<= gcd_~y2 |gcd_#in~y2|) .cse0))) [2018-11-10 12:56:56,136 INFO L428 ceAbstractionStarter]: At program point gcdENTRY(lines 15 27) the Hoare annotation is: true [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L425 ceAbstractionStarter]: For program point L26-3(line 26) no Hoare annotation was computed. [2018-11-10 12:56:56,136 INFO L421 ceAbstractionStarter]: At program point L24-2(line 24) the Hoare annotation is: (let ((.cse1 (<= 2 (* 2 gcd_~y2))) (.cse2 (* 2 |gcd_#in~y1|)) (.cse0 (* 2 |gcd_#in~y2|))) (and (or (< .cse0 2) (and .cse1 (<= (+ gcd_~y2 1) gcd_~y1)) (< 4294967294 .cse2) (< 4294967294 .cse0)) (or (< 4294967292 .cse0) .cse1 (< 4294967292 .cse2) (< .cse0 0)) (or (< 2147483647 |gcd_#in~y1|) (< 2147483647 |gcd_#in~y2|) (and (<= gcd_~y2 |gcd_#in~y2|) (= gcd_~y1 |gcd_#in~y1|) (<= 1 gcd_~y1) (<= gcd_~y1 (+ gcd_~y2 2147483646)))))) [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 19) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L16-2(lines 15 27) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 40 57) the Hoare annotation is: true [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 40 57) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L421 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0)) (.cse1 (* 2 main_~m~0))) (and (<= 2 .cse0) (<= 1 main_~z~0) (<= .cse1 4294967294) (<= .cse0 4294967294) (<= 2 .cse1))) [2018-11-10 12:56:56,137 INFO L421 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (let ((.cse0 (* 2 main_~n~0))) (and (<= 2 .cse0) (<= .cse0 4294967294) (<= 2 (* 2 main_~m~0)) (<= main_~m~0 2147483647))) [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 56) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L50-1(line 50) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L49-1(lines 40 57) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-10 12:56:56,137 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 44) no Hoare annotation was computed. [2018-11-10 12:56:56,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:56:56 BoogieIcfgContainer [2018-11-10 12:56:56,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:56:56,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:56:56,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:56:56,140 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:56:56,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:56:44" (3/4) ... [2018-11-10 12:56:56,142 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:56:56,146 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:56:56,146 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure divides [2018-11-10 12:56:56,146 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2018-11-10 12:56:56,146 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:56:56,150 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 12:56:56,150 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-10 12:56:56,150 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:56:56,183 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5284023b-0113-4dcd-b02e-bda38c40e5e9/bin-2019/utaipan/witness.graphml [2018-11-10 12:56:56,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:56:56,183 INFO L168 Benchmark]: Toolchain (without parser) took 12189.34 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 492.3 MB). Free memory was 960.3 MB in the beginning and 1.3 GB in the end (delta: -320.9 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:56:56,184 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:56:56,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.94 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:56:56,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.33 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:56:56,185 INFO L168 Benchmark]: Boogie Preprocessor took 13.99 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:56:56,185 INFO L168 Benchmark]: RCFGBuilder took 252.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -205.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-10 12:56:56,185 INFO L168 Benchmark]: TraceAbstraction took 11718.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -128.6 MB). Peak memory consumption was 535.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:56:56,186 INFO L168 Benchmark]: Witness Printer took 43.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:56:56,190 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.94 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.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 14.33 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.99 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 946.9 MB in the beginning and 1.2 GB in the end (delta: -205.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11718.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -128.6 MB). Peak memory consumption was 535.8 MB. Max. memory is 11.5 GB. * Witness Printer took 43.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. 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: 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 - 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 - 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, 11.6s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 279 SDtfs, 746 SDslu, 1670 SDs, 0 SdLazy, 1714 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 418 GetRequests, 133 SyntacticMatches, 7 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2392 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 4 AbstIntIterations, 4 AbstIntStrong, 0.8827210884353741 AbsIntWeakeningRatio, 0.6571428571428571 AbsIntAvgWeakeningVarsNumRemoved, 14.564285714285715 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 61 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 91 PreInvPairs, 125 NumberOfFragments, 236 HoareAnnotationTreeSize, 91 FomulaSimplifications, 1143 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 3990 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 437 ConstructedInterpolants, 6 QuantifiedInterpolants, 49675 SizeOfPredicates, 8 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 91/128 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...