./Ultimate.py --spec ../../sv-benchmarks/c/NoOverflows.prp --file ../../sv-benchmarks/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/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 9918b49e0d76e4ce36b6a6760021b33460a8ae9b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 01:33:19,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:33:19,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:33:19,622 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:33:19,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:33:19,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:33:19,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:33:19,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:33:19,625 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:33:19,626 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:33:19,627 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:33:19,627 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:33:19,627 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:33:19,628 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:33:19,629 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:33:19,630 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:33:19,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:33:19,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:33:19,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:33:19,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:33:19,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:33:19,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:33:19,637 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:33:19,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:33:19,638 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:33:19,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:33:19,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:33:19,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:33:19,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:33:19,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:33:19,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:33:19,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:33:19,642 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:33:19,642 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:33:19,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:33:19,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:33:19,643 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/config/svcomp-Overflow-32bit-Taipan_Default.epf [2018-11-10 01:33:19,653 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:33:19,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:33:19,654 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 01:33:19,654 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 01:33:19,655 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 01:33:19,655 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 01:33:19,655 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 01:33:19,655 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 01:33:19,655 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 01:33:19,655 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 01:33:19,655 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 01:33:19,656 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:33:19,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:33:19,656 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:33:19,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:33:19,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:33:19,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:33:19,657 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 01:33:19,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 01:33:19,657 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 01:33:19,658 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-10 01:33:19,658 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:33:19,658 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 01:33:19,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:33:19,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 01:33:19,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 01:33:19,660 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 01:33:19,660 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_1b08c4ed-c515-47df-aa01-13b4e2ce064c/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 -> 9918b49e0d76e4ce36b6a6760021b33460a8ae9b [2018-11-10 01:33:19,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:33:19,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:33:19,697 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:33:19,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:33:19,699 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:33:19,700 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 01:33:19,753 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/data/970a57f42/75001a20f5784d109b395a50b79bbfa6/FLAG603779756 [2018-11-10 01:33:20,073 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:33:20,073 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/sv-benchmarks/c/bitvector/gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 01:33:20,078 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/data/970a57f42/75001a20f5784d109b395a50b79bbfa6/FLAG603779756 [2018-11-10 01:33:20,087 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/data/970a57f42/75001a20f5784d109b395a50b79bbfa6 [2018-11-10 01:33:20,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:33:20,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:33:20,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:33:20,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:33:20,093 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:33:20,094 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585e7ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20, skipping insertion in model container [2018-11-10 01:33:20,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:33:20,115 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:33:20,213 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:33:20,216 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:33:20,227 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:33:20,235 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:33:20,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20 WrapperNode [2018-11-10 01:33:20,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:33:20,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:33:20,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:33:20,236 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:33:20,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:33:20,247 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:33:20,247 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:33:20,247 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:33:20,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... [2018-11-10 01:33:20,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:33:20,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:33:20,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:33:20,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:33:20,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 01:33:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 01:33:20,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 01:33:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:33:20,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:33:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 01:33:20,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 01:33:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 01:33:20,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 01:33:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure gcd_test [2018-11-10 01:33:20,340 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd_test [2018-11-10 01:33:20,458 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:33:20,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:33:20 BoogieIcfgContainer [2018-11-10 01:33:20,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:33:20,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 01:33:20,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 01:33:20,461 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 01:33:20,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:33:20" (1/3) ... [2018-11-10 01:33:20,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fa31c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:33:20, skipping insertion in model container [2018-11-10 01:33:20,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:33:20" (2/3) ... [2018-11-10 01:33:20,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fa31c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:33:20, skipping insertion in model container [2018-11-10 01:33:20,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:33:20" (3/3) ... [2018-11-10 01:33:20,464 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 01:33:20,472 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 01:33:20,478 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-10 01:33:20,490 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-10 01:33:20,511 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 01:33:20,512 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 01:33:20,512 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 01:33:20,512 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:33:20,512 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:33:20,512 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 01:33:20,512 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:33:20,512 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 01:33:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-10 01:33:20,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-10 01:33:20,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:20,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:20,529 INFO L424 AbstractCegarLoop]: === Iteration 1 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:20,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:20,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1733380565, now seen corresponding path program 1 times [2018-11-10 01:33:20,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:20,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:20,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:20,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:20,566 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:20,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:20,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:33:20,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:33:20,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:33:20,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:33:20,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:33:20,650 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 5 states. [2018-11-10 01:33:20,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:20,737 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2018-11-10 01:33:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:33:20,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-10 01:33:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:20,744 INFO L225 Difference]: With dead ends: 94 [2018-11-10 01:33:20,744 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 01:33:20,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:33:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 01:33:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2018-11-10 01:33:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-10 01:33:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-10 01:33:20,772 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 9 [2018-11-10 01:33:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:20,772 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-10 01:33:20,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:33:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-10 01:33:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 01:33:20,773 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:20,773 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:20,774 INFO L424 AbstractCegarLoop]: === Iteration 2 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:20,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2099771252, now seen corresponding path program 1 times [2018-11-10 01:33:20,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:20,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:20,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:20,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:20,775 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:20,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:20,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 01:33:20,806 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:33:20,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:33:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:33:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:33:20,807 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-11-10 01:33:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:20,877 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-10 01:33:20,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:33:20,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-10 01:33:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:20,878 INFO L225 Difference]: With dead ends: 48 [2018-11-10 01:33:20,878 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 01:33:20,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:33:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 01:33:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-11-10 01:33:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 01:33:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-10 01:33:20,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 10 [2018-11-10 01:33:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:20,883 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-10 01:33:20,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:33:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-10 01:33:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 01:33:20,884 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:20,884 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:20,885 INFO L424 AbstractCegarLoop]: === Iteration 3 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:20,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:20,885 INFO L82 PathProgramCache]: Analyzing trace with hash -634751433, now seen corresponding path program 1 times [2018-11-10 01:33:20,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:20,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:20,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:20,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:20,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:20,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:20,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:33:20,943 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:33:20,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:33:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:33:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:33:20,944 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-10 01:33:21,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:21,013 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-10 01:33:21,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:33:21,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-10 01:33:21,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:21,014 INFO L225 Difference]: With dead ends: 37 [2018-11-10 01:33:21,015 INFO L226 Difference]: Without dead ends: 35 [2018-11-10 01:33:21,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:33:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-10 01:33:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-11-10 01:33:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 01:33:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-10 01:33:21,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2018-11-10 01:33:21,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:21,019 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-10 01:33:21,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:33:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-10 01:33:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 01:33:21,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:21,020 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:21,020 INFO L424 AbstractCegarLoop]: === Iteration 4 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:21,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash -634751625, now seen corresponding path program 1 times [2018-11-10 01:33:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:21,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:21,021 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:21,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:33:21,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 01:33:21,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:33:21,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 01:33:21,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:33:21,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:33:21,046 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2018-11-10 01:33:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:21,110 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-10 01:33:21,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 01:33:21,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-10 01:33:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:21,112 INFO L225 Difference]: With dead ends: 36 [2018-11-10 01:33:21,112 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 01:33:21,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-10 01:33:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 01:33:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-11-10 01:33:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 01:33:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-10 01:33:21,119 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2018-11-10 01:33:21,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:21,119 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-10 01:33:21,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 01:33:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-10 01:33:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 01:33:21,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:21,120 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:21,123 INFO L424 AbstractCegarLoop]: === Iteration 5 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:21,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:21,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1352493196, now seen corresponding path program 1 times [2018-11-10 01:33:21,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:21,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:21,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:21,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:21,125 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:21,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:21,178 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:33:21,179 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 01:33:21,181 INFO L202 CegarAbsIntRunner]: [0], [4], [22], [31], [41], [46], [50], [56], [65], [66], [67], [69], [76], [77], [78], [80] [2018-11-10 01:33:21,218 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:33:21,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:33:21,298 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 01:33:21,299 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Never found a fixpoint. Largest state had 4 variables. [2018-11-10 01:33:21,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:21,304 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 01:33:21,353 INFO L227 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 01:33:21,353 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 01:33:21,387 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-10 01:33:21,387 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 01:33:21,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:33:21,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-11-10 01:33:21,388 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:33:21,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 01:33:21,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:33:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:33:21,389 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2018-11-10 01:33:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:21,496 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-10 01:33:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:33:21,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-10 01:33:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:21,497 INFO L225 Difference]: With dead ends: 34 [2018-11-10 01:33:21,497 INFO L226 Difference]: Without dead ends: 24 [2018-11-10 01:33:21,498 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:33:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-10 01:33:21,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-10 01:33:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 01:33:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-10 01:33:21,501 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2018-11-10 01:33:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:21,502 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-10 01:33:21,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 01:33:21,502 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-10 01:33:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 01:33:21,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:21,502 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:21,503 INFO L424 AbstractCegarLoop]: === Iteration 6 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:21,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1735103278, now seen corresponding path program 1 times [2018-11-10 01:33:21,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:21,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:21,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:21,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:21,504 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:21,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:21,546 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:33:21,546 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-10 01:33:21,546 INFO L202 CegarAbsIntRunner]: [0], [4], [22], [31], [41], [46], [50], [56], [59], [61], [63], [65], [66], [76], [77], [78], [80] [2018-11-10 01:33:21,548 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:33:21,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:33:21,599 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 01:33:21,599 INFO L272 AbstractInterpreter]: Visited 17 different actions 42 times. Merged at 6 different actions 21 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-11-10 01:33:21,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:21,613 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 01:33:21,651 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 50% of their original sizes. [2018-11-10 01:33:21,651 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 01:33:21,706 INFO L415 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2018-11-10 01:33:21,706 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 01:33:21,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 01:33:21,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2018-11-10 01:33:21,707 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:33:21,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 01:33:21,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 01:33:21,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-10 01:33:21,708 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2018-11-10 01:33:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:21,992 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-10 01:33:21,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 01:33:21,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-10 01:33:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:21,993 INFO L225 Difference]: With dead ends: 43 [2018-11-10 01:33:21,993 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 01:33:21,993 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-10 01:33:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 01:33:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-10 01:33:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 01:33:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-10 01:33:22,000 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 19 [2018-11-10 01:33:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:22,000 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-10 01:33:22,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 01:33:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-10 01:33:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 01:33:22,001 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:22,001 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:22,001 INFO L424 AbstractCegarLoop]: === Iteration 7 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:22,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:22,002 INFO L82 PathProgramCache]: Analyzing trace with hash 203854100, now seen corresponding path program 1 times [2018-11-10 01:33:22,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:22,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:22,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:22,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:22,003 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 01:33:22,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:22,059 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:33:22,060 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-10 01:33:22,060 INFO L202 CegarAbsIntRunner]: [0], [4], [22], [31], [41], [46], [50], [56], [59], [61], [63], [65], [66], [67], [69], [76], [77], [78], [80] [2018-11-10 01:33:22,061 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:33:22,061 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:33:22,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 01:33:22,317 INFO L272 AbstractInterpreter]: Visited 19 different actions 408 times. Merged at 9 different actions 308 times. Widened at 2 different actions 45 times. Found 49 fixpoints after 6 different actions. Largest state had 4 variables. [2018-11-10 01:33:22,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:22,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 01:33:22,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:22,332 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 01:33:22,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:22,338 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 01:33:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:22,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:33:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:33:22,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:33:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 01:33:22,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 01:33:22,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2018-11-10 01:33:22,555 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 01:33:22,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 01:33:22,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 01:33:22,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-11-10 01:33:22,556 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 13 states. [2018-11-10 01:33:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:22,753 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-11-10 01:33:22,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 01:33:22,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-10 01:33:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:22,754 INFO L225 Difference]: With dead ends: 77 [2018-11-10 01:33:22,755 INFO L226 Difference]: Without dead ends: 67 [2018-11-10 01:33:22,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=605, Unknown=0, NotChecked=0, Total=812 [2018-11-10 01:33:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-10 01:33:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2018-11-10 01:33:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 01:33:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-10 01:33:22,763 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 29 [2018-11-10 01:33:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:22,763 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-10 01:33:22,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 01:33:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-10 01:33:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 01:33:22,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:22,764 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:22,766 INFO L424 AbstractCegarLoop]: === Iteration 8 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:22,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash -859371907, now seen corresponding path program 1 times [2018-11-10 01:33:22,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:22,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:22,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:22,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:22,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:22,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:22,832 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:33:22,832 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-10 01:33:22,832 INFO L202 CegarAbsIntRunner]: [0], [4], [22], [31], [41], [46], [50], [56], [59], [60], [61], [63], [65], [67], [69], [76], [77], [78], [80] [2018-11-10 01:33:22,833 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 01:33:22,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 01:33:23,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 01:33:23,009 INFO L272 AbstractInterpreter]: Visited 19 different actions 409 times. Merged at 9 different actions 308 times. Widened at 2 different actions 45 times. Found 49 fixpoints after 6 different actions. Largest state had 4 variables. [2018-11-10 01:33:23,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:23,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 01:33:23,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:23,030 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/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-10 01:33:23,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:23,038 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 01:33:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:23,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:33:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:23,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:33:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:33:23,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 01:33:23,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2018-11-10 01:33:23,364 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 01:33:23,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 01:33:23,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 01:33:23,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2018-11-10 01:33:23,366 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 16 states. [2018-11-10 01:33:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:23,573 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2018-11-10 01:33:23,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 01:33:23,573 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-10 01:33:23,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:23,574 INFO L225 Difference]: With dead ends: 88 [2018-11-10 01:33:23,574 INFO L226 Difference]: Without dead ends: 59 [2018-11-10 01:33:23,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2018-11-10 01:33:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-10 01:33:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-10 01:33:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 01:33:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-11-10 01:33:23,583 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 34 [2018-11-10 01:33:23,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:23,584 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-11-10 01:33:23,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 01:33:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-11-10 01:33:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 01:33:23,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:23,584 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:23,585 INFO L424 AbstractCegarLoop]: === Iteration 9 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:23,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:23,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2000009774, now seen corresponding path program 2 times [2018-11-10 01:33:23,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:23,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:23,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:33:23,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:23,588 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 31 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-10 01:33:23,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:23,622 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:33:23,622 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 01:33:23,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 01:33:23,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:23,623 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/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-10 01:33:23,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 01:33:23,639 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 01:33:23,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 01:33:23,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:33:23,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:33:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 01:33:23,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:33:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 01:33:23,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:33:23,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 19 [2018-11-10 01:33:23,864 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 01:33:23,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 01:33:23,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 01:33:23,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-11-10 01:33:23,865 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 9 states. [2018-11-10 01:33:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:23,992 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2018-11-10 01:33:23,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 01:33:23,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-10 01:33:23,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:23,993 INFO L225 Difference]: With dead ends: 77 [2018-11-10 01:33:23,993 INFO L226 Difference]: Without dead ends: 76 [2018-11-10 01:33:23,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2018-11-10 01:33:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-10 01:33:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 41. [2018-11-10 01:33:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 01:33:23,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-10 01:33:23,999 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-11-10 01:33:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:23,999 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-10 01:33:23,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 01:33:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-10 01:33:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-10 01:33:24,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 01:33:24,000 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 01:33:24,000 INFO L424 AbstractCegarLoop]: === Iteration 10 === [gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-10 01:33:24,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:33:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2000009582, now seen corresponding path program 2 times [2018-11-10 01:33:24,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 01:33:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:24,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:33:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:33:24,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 01:33:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:33:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 01:33:24,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:24,021 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 01:33:24,021 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 01:33:24,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 01:33:24,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:33:24,022 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/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-10 01:33:24,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 01:33:24,027 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 01:33:24,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 01:33:24,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:33:24,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:33:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 01:33:24,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 01:33:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 01:33:24,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 01:33:24,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 14 [2018-11-10 01:33:24,150 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 01:33:24,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 01:33:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 01:33:24,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-11-10 01:33:24,151 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 12 states. [2018-11-10 01:33:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:33:24,268 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-10 01:33:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 01:33:24,269 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-11-10 01:33:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 01:33:24,269 INFO L225 Difference]: With dead ends: 46 [2018-11-10 01:33:24,269 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 01:33:24,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-11-10 01:33:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 01:33:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 01:33:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 01:33:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 01:33:24,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-10 01:33:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 01:33:24,271 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 01:33:24,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 01:33:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 01:33:24,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 01:33:24,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 01:33:24,632 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 41 [2018-11-10 01:33:24,634 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 01:33:24,634 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 01:33:24,634 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 01:33:24,634 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 01:33:24,634 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 01:33:24,634 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 01:33:24,634 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 30 46) the Hoare annotation is: true [2018-11-10 01:33:24,635 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 30 46) no Hoare annotation was computed. [2018-11-10 01:33:24,635 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 01:33:24,635 INFO L421 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (<= 63 main_~x~0) [2018-11-10 01:33:24,635 INFO L421 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (<= 63 main_~x~0) [2018-11-10 01:33:24,635 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 30 46) no Hoare annotation was computed. [2018-11-10 01:33:24,635 INFO L421 ceAbstractionStarter]: At program point L41-1(line 41) the Hoare annotation is: (<= 63 main_~x~0) [2018-11-10 01:33:24,635 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (and (<= main_~x~0 (+ main_~y~0 45)) (<= 81 (+ main_~x~0 main_~y~0)) (<= main_~y~0 18)) [2018-11-10 01:33:24,635 INFO L425 ceAbstractionStarter]: For program point L39-1(line 39) no Hoare annotation was computed. [2018-11-10 01:33:24,635 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-10 01:33:24,635 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-10 01:33:24,635 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-10 01:33:24,635 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-10 01:33:24,635 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point gcd_testErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 25) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 25) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 24) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L421 ceAbstractionStarter]: At program point L20-2(lines 19 25) the Hoare annotation is: (let ((.cse2 (* 2 gcd_test_~b)) (.cse1 (<= gcd_test_~b 18))) (or (let ((.cse0 (+ .cse2 gcd_test_~a))) (and (<= 18 gcd_test_~b) (<= .cse0 63) (<= 63 .cse0) .cse1)) (< 18 |gcd_test_#in~b|) (< (+ |gcd_test_#in~a| |gcd_test_#in~b|) 81) (and (<= 0 gcd_test_~b) (<= gcd_test_~a 18) (and (<= 1 gcd_test_~a) .cse1)) (and (= gcd_test_~a 63) (<= 36 .cse2) .cse1) (let ((.cse3 (+ gcd_test_~b gcd_test_~a))) (and (<= .cse3 63) (= gcd_test_~b 18) (<= 63 .cse3))) (< 126 (* 2 |gcd_test_#in~a|)))) [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point gcd_testErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point L12-2(line 12) no Hoare annotation was computed. [2018-11-10 01:33:24,636 INFO L425 ceAbstractionStarter]: For program point L12-4(lines 11 27) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point gcd_testErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point gcd_testEXIT(lines 10 27) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point gcd_testErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point gcd_testErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 23) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point L13-1(line 13) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point L13-3(lines 11 27) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L428 ceAbstractionStarter]: At program point gcd_testENTRY(lines 10 27) the Hoare annotation is: true [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point gcd_testErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 13) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point gcd_testErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 21) no Hoare annotation was computed. [2018-11-10 01:33:24,637 INFO L425 ceAbstractionStarter]: For program point gcd_testErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 12) no Hoare annotation was computed. [2018-11-10 01:33:24,638 INFO L425 ceAbstractionStarter]: For program point gcd_testFINAL(lines 10 27) no Hoare annotation was computed. [2018-11-10 01:33:24,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:33:24 BoogieIcfgContainer [2018-11-10 01:33:24,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 01:33:24,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:33:24,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:33:24,647 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:33:24,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:33:20" (3/4) ... [2018-11-10 01:33:24,650 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 01:33:24,654 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 01:33:24,654 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 01:33:24,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 01:33:24,655 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure gcd_test [2018-11-10 01:33:24,659 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-10 01:33:24,659 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 01:33:24,659 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 01:33:24,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((18 <= b && 2 * b + a <= 63) && 63 <= 2 * b + a) && b <= 18) || 18 < \old(b)) || \old(a) + \old(b) < 81) || ((0 <= b && a <= 18) && 1 <= a && b <= 18)) || ((a == 63 && 36 <= 2 * b) && b <= 18)) || ((b + a <= 63 && b == 18) && 63 <= b + a)) || 126 < 2 * \old(a) [2018-11-10 01:33:24,696 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1b08c4ed-c515-47df-aa01-13b4e2ce064c/bin-2019/utaipan/witness.graphml [2018-11-10 01:33:24,696 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:33:24,696 INFO L168 Benchmark]: Toolchain (without parser) took 4606.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 170.1 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:24,697 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:33:24,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.77 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:24,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.05 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 947.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:24,698 INFO L168 Benchmark]: Boogie Preprocessor took 13.72 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:24,698 INFO L168 Benchmark]: RCFGBuilder took 197.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 945.1 MB in the beginning and 1.2 GB in the end (delta: -235.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:24,698 INFO L168 Benchmark]: TraceAbstraction took 4187.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. [2018-11-10 01:33:24,698 INFO L168 Benchmark]: Witness Printer took 48.94 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:33:24,700 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.77 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.05 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 947.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.72 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 197.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 945.1 MB in the beginning and 1.2 GB in the end (delta: -235.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4187.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. * Witness Printer took 48.94 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 12]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((((18 <= b && 2 * b + a <= 63) && 63 <= 2 * b + a) && b <= 18) || 18 < \old(b)) || \old(a) + \old(b) < 81) || ((0 <= b && a <= 18) && 1 <= a && b <= 18)) || ((a == 63 && 36 <= 2 * b) && b <= 18)) || ((b + a <= 63 && b == 18) && 63 <= b + a)) || 126 < 2 * \old(a) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 8 error locations. SAFE Result, 4.1s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 120 SDtfs, 479 SDslu, 422 SDs, 0 SdLazy, 666 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 406 GetRequests, 264 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9351851851851853 AbsIntWeakeningRatio, 0.3888888888888889 AbsIntAvgWeakeningVarsNumRemoved, 9.38888888888889 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 97 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 16 PreInvPairs, 26 NumberOfFragments, 107 HoareAnnotationTreeSize, 16 FomulaSimplifications, 3382 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 1438 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 367 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 490 ConstructedInterpolants, 46 QuantifiedInterpolants, 79450 SizeOfPredicates, 12 NumberOfNonLiveVariables, 215 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 263/520 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...