./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/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_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/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-5842f4b [2018-11-18 13:19:45,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:19:45,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:19:45,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:19:45,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:19:45,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:19:45,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:19:45,026 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:19:45,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:19:45,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:19:45,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:19:45,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:19:45,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:19:45,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:19:45,031 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:19:45,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:19:45,032 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:19:45,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:19:45,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:19:45,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:19:45,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:19:45,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:19:45,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:19:45,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:19:45,039 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:19:45,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:19:45,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:19:45,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:19:45,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:19:45,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:19:45,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:19:45,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:19:45,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:19:45,044 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:19:45,045 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:19:45,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:19:45,046 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-18 13:19:45,056 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:19:45,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:19:45,057 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:19:45,057 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:19:45,058 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:19:45,058 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:19:45,058 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:19:45,058 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 13:19:45,058 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:19:45,058 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:19:45,058 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 13:19:45,058 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 13:19:45,059 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:19:45,059 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:19:45,059 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:19:45,059 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 13:19:45,060 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:19:45,060 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:19:45,060 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:19:45,060 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:19:45,060 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:19:45,060 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:19:45,060 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-18 13:19:45,060 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:19:45,061 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:19:45,061 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:19:45,061 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:19:45,061 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:19:45,061 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:19:45,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:19:45,061 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:19:45,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:19:45,062 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:19:45,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:19:45,062 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:19:45,062 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 13:19:45,062 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:19:45,062 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:19:45,062 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 13:19:45,063 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_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/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-18 13:19:45,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:19:45,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:19:45,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:19:45,101 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:19:45,101 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:19:45,102 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/../../sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-18 13:19:45,150 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/data/e28dfb8a8/8bed174ba3df47cc90184e7046589e30/FLAG8141fa59f [2018-11-18 13:19:45,457 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:19:45,458 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/sv-benchmarks/c/recursive/gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-18 13:19:45,463 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/data/e28dfb8a8/8bed174ba3df47cc90184e7046589e30/FLAG8141fa59f [2018-11-18 13:19:45,472 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/data/e28dfb8a8/8bed174ba3df47cc90184e7046589e30 [2018-11-18 13:19:45,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:19:45,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:19:45,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:19:45,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:19:45,479 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:19:45,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45, skipping insertion in model container [2018-11-18 13:19:45,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:19:45,501 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:19:45,614 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:19:45,616 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:19:45,627 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:19:45,636 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:19:45,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45 WrapperNode [2018-11-18 13:19:45,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:19:45,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:19:45,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:19:45,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:19:45,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:19:45,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:19:45,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:19:45,649 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:19:45,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... [2018-11-18 13:19:45,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:19:45,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:19:45,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:19:45,663 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:19:45,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/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-18 13:19:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:19:45,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:19:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2018-11-18 13:19:45,733 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2018-11-18 13:19:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2018-11-18 13:19:45,733 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2018-11-18 13:19:45,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:19:45,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:19:45,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:19:45,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:19:45,879 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:19:45,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:19:45 BoogieIcfgContainer [2018-11-18 13:19:45,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:19:45,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:19:45,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:19:45,883 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:19:45,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:19:45" (1/3) ... [2018-11-18 13:19:45,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782809b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:19:45, skipping insertion in model container [2018-11-18 13:19:45,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:19:45" (2/3) ... [2018-11-18 13:19:45,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@782809b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:19:45, skipping insertion in model container [2018-11-18 13:19:45,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:19:45" (3/3) ... [2018-11-18 13:19:45,886 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02_true-unreach-call_true-no-overflow_true-termination.c [2018-11-18 13:19:45,895 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:19:45,900 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-18 13:19:45,909 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-18 13:19:45,933 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:19:45,933 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:19:45,934 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:19:45,934 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:19:45,934 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:19:45,934 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:19:45,934 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:19:45,934 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:19:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-18 13:19:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 13:19:45,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:45,954 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:19:45,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:45,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:45,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1091942582, now seen corresponding path program 1 times [2018-11-18 13:19:45,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:45,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:45,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:45,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:46,107 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-18 13:19:46,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:46,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:19:46,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:46,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:19:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:19:46,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:19:46,126 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 6 states. [2018-11-18 13:19:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:46,294 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2018-11-18 13:19:46,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:19:46,296 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-18 13:19:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:46,302 INFO L225 Difference]: With dead ends: 85 [2018-11-18 13:19:46,303 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 13:19:46,306 INFO L604 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-18 13:19:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 13:19:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-18 13:19:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 13:19:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-18 13:19:46,336 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2018-11-18 13:19:46,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:46,336 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-18 13:19:46,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:19:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 13:19:46,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-18 13:19:46,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:46,338 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:19:46,338 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:46,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:46,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1091942806, now seen corresponding path program 1 times [2018-11-18 13:19:46,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:46,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:46,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:46,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:46,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:46,400 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-18 13:19:46,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:46,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 13:19:46,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:46,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:19:46,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:19:46,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:19:46,402 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-11-18 13:19:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:46,480 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-18 13:19:46,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 13:19:46,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-18 13:19:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:46,482 INFO L225 Difference]: With dead ends: 35 [2018-11-18 13:19:46,482 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 13:19:46,483 INFO L604 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-18 13:19:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 13:19:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-18 13:19:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 13:19:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-18 13:19:46,487 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-11-18 13:19:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:46,488 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-18 13:19:46,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:19:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-18 13:19:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:19:46,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:46,489 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-18 13:19:46,489 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:46,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:46,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1535417245, now seen corresponding path program 1 times [2018-11-18 13:19:46,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:46,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:46,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:46,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:46,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:46,553 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-18 13:19:46,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:46,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 13:19:46,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:46,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 13:19:46,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:19:46,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:19:46,554 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2018-11-18 13:19:46,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:46,685 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-18 13:19:46,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:19:46,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-18 13:19:46,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:46,689 INFO L225 Difference]: With dead ends: 45 [2018-11-18 13:19:46,689 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 13:19:46,689 INFO L604 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-18 13:19:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 13:19:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-18 13:19:46,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 13:19:46,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-18 13:19:46,699 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-11-18 13:19:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:46,700 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-18 13:19:46,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 13:19:46,700 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-18 13:19:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 13:19:46,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:46,701 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-18 13:19:46,701 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:46,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash 353294382, now seen corresponding path program 1 times [2018-11-18 13:19:46,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:46,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:46,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:46,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:46,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:46,726 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-18 13:19:46,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:46,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:19:46,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:46,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:19:46,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:19:46,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:19:46,728 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-11-18 13:19:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:46,737 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-18 13:19:46,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:19:46,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 13:19:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:46,738 INFO L225 Difference]: With dead ends: 41 [2018-11-18 13:19:46,738 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 13:19:46,739 INFO L604 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-18 13:19:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 13:19:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-18 13:19:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-18 13:19:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-18 13:19:46,744 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 21 [2018-11-18 13:19:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:46,744 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-18 13:19:46,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:19:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-18 13:19:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 13:19:46,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:46,745 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-18 13:19:46,745 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:46,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:46,746 INFO L82 PathProgramCache]: Analyzing trace with hash -823556285, now seen corresponding path program 1 times [2018-11-18 13:19:46,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:46,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:46,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:46,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:46,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:46,833 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-18 13:19:46,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:46,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:19:46,834 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-11-18 13:19:46,835 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [17], [24], [28], [46], [50], [54], [58], [61], [63], [77], [83], [84], [85], [87], [88], [89] [2018-11-18 13:19:46,859 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:19:46,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:19:46,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:19:46,964 INFO L272 AbstractInterpreter]: Visited 23 different actions 44 times. Never merged. Never widened. Performed 124 root evaluator evaluations with a maximum evaluation depth of 3. Performed 124 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-11-18 13:19:46,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:46,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:19:46,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:46,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/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-18 13:19:46,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:46,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:19:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:46,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:19:47,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:19:47,347 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-18 13:19:47,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:19:47,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10, 10] total 26 [2018-11-18 13:19:47,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:47,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:19:47,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:19:47,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2018-11-18 13:19:47,363 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 11 states. [2018-11-18 13:19:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:47,486 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-18 13:19:47,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:19:47,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-18 13:19:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:47,488 INFO L225 Difference]: With dead ends: 49 [2018-11-18 13:19:47,488 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 13:19:47,489 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2018-11-18 13:19:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 13:19:47,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-18 13:19:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 13:19:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-11-18 13:19:47,493 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 26 [2018-11-18 13:19:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:47,494 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-11-18 13:19:47,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:19:47,494 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-18 13:19:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:19:47,495 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:47,495 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-18 13:19:47,495 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:47,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:47,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1123279450, now seen corresponding path program 1 times [2018-11-18 13:19:47,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:47,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:47,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:47,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:47,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:47,555 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-18 13:19:47,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:47,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 13:19:47,556 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:47,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:19:47,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:19:47,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:19:47,556 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 10 states. [2018-11-18 13:19:47,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:47,673 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-18 13:19:47,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:19:47,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-18 13:19:47,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:47,674 INFO L225 Difference]: With dead ends: 46 [2018-11-18 13:19:47,675 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 13:19:47,675 INFO L604 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-18 13:19:47,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 13:19:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-18 13:19:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 13:19:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-18 13:19:47,680 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 30 [2018-11-18 13:19:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:47,680 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 13:19:47,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:19:47,681 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-18 13:19:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:19:47,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:47,682 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-18 13:19:47,684 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:47,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:47,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1396968422, now seen corresponding path program 1 times [2018-11-18 13:19:47,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:47,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:47,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:47,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:47,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:47,738 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-18 13:19:47,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:47,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 13:19:47,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:47,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 13:19:47,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 13:19:47,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 13:19:47,740 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 9 states. [2018-11-18 13:19:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:47,826 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-18 13:19:47,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:19:47,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-11-18 13:19:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:47,827 INFO L225 Difference]: With dead ends: 55 [2018-11-18 13:19:47,827 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 13:19:47,828 INFO L604 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-18 13:19:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 13:19:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-18 13:19:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 13:19:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-11-18 13:19:47,832 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 30 [2018-11-18 13:19:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:47,832 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-18 13:19:47,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 13:19:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2018-11-18 13:19:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 13:19:47,834 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:47,834 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-18 13:19:47,834 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:47,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash 692456512, now seen corresponding path program 1 times [2018-11-18 13:19:47,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:47,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:47,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:47,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:47,900 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-18 13:19:47,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:47,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:19:47,901 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-18 13:19:47,901 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [17], [24], [28], [29], [32], [34], [36], [38], [46], [50], [54], [58], [61], [63], [77], [79], [80], [83], [84], [85], [87], [88], [89] [2018-11-18 13:19:47,902 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:19:47,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:19:47,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:19:47,965 INFO L272 AbstractInterpreter]: Visited 30 different actions 82 times. Never merged. Never widened. Performed 232 root evaluator evaluations with a maximum evaluation depth of 3. Performed 232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 6 variables. [2018-11-18 13:19:47,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:47,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:19:47,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:47,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:19:47,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:47,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:19:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:47,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:19:48,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:19:48,255 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-18 13:19:48,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:19:48,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 25 [2018-11-18 13:19:48,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:48,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:19:48,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:19:48,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-11-18 13:19:48,272 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand 12 states. [2018-11-18 13:19:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:48,394 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-18 13:19:48,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:19:48,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-18 13:19:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:48,395 INFO L225 Difference]: With dead ends: 61 [2018-11-18 13:19:48,395 INFO L226 Difference]: Without dead ends: 46 [2018-11-18 13:19:48,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2018-11-18 13:19:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-18 13:19:48,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-18 13:19:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 13:19:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-11-18 13:19:48,401 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 36 [2018-11-18 13:19:48,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:48,401 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-11-18 13:19:48,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:19:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-11-18 13:19:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:19:48,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:48,403 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-18 13:19:48,403 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:48,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:48,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1785186173, now seen corresponding path program 1 times [2018-11-18 13:19:48,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:48,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:48,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:48,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:48,482 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-18 13:19:48,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:19:48,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 13:19:48,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:48,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 13:19:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 13:19:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 13:19:48,483 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 11 states. [2018-11-18 13:19:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:48,581 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-18 13:19:48,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 13:19:48,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2018-11-18 13:19:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:48,582 INFO L225 Difference]: With dead ends: 53 [2018-11-18 13:19:48,582 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 13:19:48,582 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-18 13:19:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 13:19:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2018-11-18 13:19:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 13:19:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 13:19:48,586 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 40 [2018-11-18 13:19:48,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:48,586 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 13:19:48,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 13:19:48,586 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 13:19:48,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 13:19:48,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:48,587 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-18 13:19:48,587 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:48,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:48,588 INFO L82 PathProgramCache]: Analyzing trace with hash 329895424, now seen corresponding path program 1 times [2018-11-18 13:19:48,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:48,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:48,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:48,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:48,658 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-18 13:19:48,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:48,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:19:48,659 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-18 13:19:48,659 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [17], [24], [28], [29], [39], [41], [43], [45], [46], [50], [54], [58], [61], [63], [77], [81], [82], [83], [84], [85], [87], [88], [89] [2018-11-18 13:19:48,660 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:19:48,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:19:48,696 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:19:48,696 INFO L272 AbstractInterpreter]: Visited 30 different actions 82 times. Never merged. Never widened. Performed 232 root evaluator evaluations with a maximum evaluation depth of 3. Performed 232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 3 different actions. Largest state had 6 variables. [2018-11-18 13:19:48,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:48,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:19:48,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:48,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:19:48,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:48,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:19:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:48,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:19:48,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:19:49,035 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-18 13:19:49,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:19:49,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 28 [2018-11-18 13:19:49,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:49,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 13:19:49,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 13:19:49,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-11-18 13:19:49,053 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 12 states. [2018-11-18 13:19:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:49,168 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-11-18 13:19:49,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:19:49,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-18 13:19:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:49,169 INFO L225 Difference]: With dead ends: 59 [2018-11-18 13:19:49,169 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 13:19:49,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 13:19:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 13:19:49,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-18 13:19:49,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 13:19:49,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-18 13:19:49,174 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 36 [2018-11-18 13:19:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:49,174 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 13:19:49,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 13:19:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-18 13:19:49,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 13:19:49,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:19:49,175 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-18 13:19:49,175 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-18 13:19:49,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash -587969757, now seen corresponding path program 1 times [2018-11-18 13:19:49,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:19:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:49,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:19:49,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:19:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:49,265 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-18 13:19:49,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:49,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:19:49,265 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-18 13:19:49,265 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [10], [11], [13], [17], [24], [28], [29], [32], [34], [36], [38], [39], [41], [43], [45], [46], [50], [54], [58], [61], [63], [77], [79], [80], [81], [82], [83], [84], [85], [87], [88], [89] [2018-11-18 13:19:49,267 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:19:49,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:19:49,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 13:19:49,446 INFO L272 AbstractInterpreter]: Visited 36 different actions 593 times. Never merged. Never widened. Performed 1658 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1658 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 75 fixpoints after 5 different actions. Largest state had 7 variables. [2018-11-18 13:19:49,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:19:49,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 13:19:49,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:19:49,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:19:49,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:19:49,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 13:19:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:19:49,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:19:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 13:19:49,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:19:49,865 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-18 13:19:49,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:19:49,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [12, 12] total 25 [2018-11-18 13:19:49,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:19:49,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:19:49,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:19:49,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2018-11-18 13:19:49,883 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 13 states. [2018-11-18 13:19:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:19:49,989 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-18 13:19:49,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 13:19:49,989 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-11-18 13:19:49,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:19:49,990 INFO L225 Difference]: With dead ends: 46 [2018-11-18 13:19:49,990 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 13:19:49,990 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2018-11-18 13:19:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 13:19:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 13:19:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 13:19:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:19:49,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-11-18 13:19:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:19:49,991 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:19:49,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:19:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:19:49,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 13:19:49,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 13:19:50,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 13:19:50,148 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 13:19:50,148 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:19:50,148 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 33) no Hoare annotation was computed. [2018-11-18 13:19:50,148 INFO L425 ceAbstractionStarter]: For program point dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point dividesFINAL(lines 30 38) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point dividesEXIT(lines 30 38) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point L37-1(line 37) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L428 ceAbstractionStarter]: At program point dividesENTRY(lines 30 38) the Hoare annotation is: true [2018-11-18 13:19:50,149 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-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point L37-3(line 37) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point gcdEXIT(lines 15 27) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point gcdErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point gcdFINAL(lines 15 27) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-11-18 13:19:50,149 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L421 ceAbstractionStarter]: At program point L26-2(line 26) the Hoare annotation is: (or (< 2147483647 |gcd_#in~y1|) (and (<= gcd_~y2 2147483647) (= |gcd_#in~y1| gcd_~y1) (<= 1 gcd_~y1) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (< 2147483647 |gcd_#in~y2|)) [2018-11-18 13:19:50,150 INFO L428 ceAbstractionStarter]: At program point gcdENTRY(lines 15 27) the Hoare annotation is: true [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point L26-3(line 26) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L421 ceAbstractionStarter]: At program point L24-2(line 24) the Hoare annotation is: (or (< 2147483647 |gcd_#in~y1|) (and (<= gcd_~y2 2147483647) (= |gcd_#in~y1| gcd_~y1) (<= 1 gcd_~y1) (<= gcd_~y1 (+ gcd_~y2 2147483646))) (< 2147483647 |gcd_#in~y2|)) [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 19) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point L16-2(lines 15 27) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 13:19:50,150 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 40 57) the Hoare annotation is: true [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 40 57) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-18 13:19:50,150 INFO L421 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: (and (<= main_~n~0 2147483647) (<= 1 main_~z~0) (<= main_~m~0 2147483647)) [2018-11-18 13:19:50,150 INFO L421 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= main_~n~0 2147483647) (<= main_~m~0 2147483647)) [2018-11-18 13:19:50,151 INFO L425 ceAbstractionStarter]: For program point L51-1(line 51) no Hoare annotation was computed. [2018-11-18 13:19:50,151 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 56) no Hoare annotation was computed. [2018-11-18 13:19:50,151 INFO L425 ceAbstractionStarter]: For program point L50-1(line 50) no Hoare annotation was computed. [2018-11-18 13:19:50,151 INFO L425 ceAbstractionStarter]: For program point L51-2(lines 51 55) no Hoare annotation was computed. [2018-11-18 13:19:50,151 INFO L425 ceAbstractionStarter]: For program point L49-1(lines 40 57) no Hoare annotation was computed. [2018-11-18 13:19:50,151 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-18 13:19:50,151 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 44) no Hoare annotation was computed. [2018-11-18 13:19:50,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:19:50 BoogieIcfgContainer [2018-11-18 13:19:50,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:19:50,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:19:50,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:19:50,161 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:19:50,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:19:45" (3/4) ... [2018-11-18 13:19:50,163 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 13:19:50,167 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 13:19:50,167 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure divides [2018-11-18 13:19:50,167 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd [2018-11-18 13:19:50,168 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 13:19:50,171 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-18 13:19:50,171 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 13:19:50,171 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 13:19:50,205 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a55cb724-fd2f-42c1-9b0c-708f4b80d07e/bin-2019/utaipan/witness.graphml [2018-11-18 13:19:50,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:19:50,206 INFO L168 Benchmark]: Toolchain (without parser) took 4731.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -238.6 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:50,207 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:19:50,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:50,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.31 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:50,210 INFO L168 Benchmark]: Boogie Preprocessor took 13.06 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:19:50,210 INFO L168 Benchmark]: RCFGBuilder took 217.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:50,210 INFO L168 Benchmark]: TraceAbstraction took 4279.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.6 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:50,211 INFO L168 Benchmark]: Witness Printer took 45.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-11-18 13:19:50,213 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.95 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.3 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.31 ms. Allocated memory is still 1.0 GB. Free memory was 948.3 MB in the beginning and 945.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.06 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 217.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4279.93 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 173.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -109.6 MB). Peak memory consumption was 64.0 MB. Max. memory is 11.5 GB. * Witness Printer took 45.14 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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, 4.2s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 258 SDtfs, 255 SDslu, 1229 SDs, 0 SdLazy, 1511 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 229 SyntacticMatches, 16 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 49 PreInvPairs, 58 NumberOfFragments, 104 HoareAnnotationTreeSize, 49 FomulaSimplifications, 785 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 204 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 582 ConstructedInterpolants, 28 QuantifiedInterpolants, 67910 SizeOfPredicates, 28 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 19 InterpolantComputations, 11 PerfectInterpolantSequences, 120/152 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...