/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/gcd01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:01:39,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:01:39,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:01:39,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:01:39,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:01:39,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:01:39,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:01:39,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:01:39,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:01:39,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:01:39,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:01:39,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:01:39,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:01:39,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:01:39,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:01:39,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:01:39,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:01:39,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:01:39,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:01:39,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:01:39,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:01:39,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:01:39,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:01:39,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:01:39,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:01:39,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:01:39,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:01:39,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:01:39,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:01:39,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:01:39,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:01:39,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:01:39,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:01:39,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:01:39,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:01:39,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:01:39,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:01:39,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:01:39,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:01:39,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:01:39,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:01:39,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:01:39,418 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:01:39,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:01:39,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:01:39,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:01:39,423 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:01:39,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:01:39,423 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:01:39,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:01:39,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:01:39,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:01:39,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:01:39,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:01:39,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:01:39,425 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:01:39,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:01:39,425 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:01:39,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:01:39,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:01:39,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:01:39,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:01:39,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:01:39,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:01:39,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:01:39,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:01:39,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:01:39,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:01:39,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:01:39,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:01:39,429 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:01:39,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:01:39,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:01:39,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:01:39,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:01:39,736 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:01:39,736 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:01:39,737 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/gcd01-1.c [2020-07-08 12:01:39,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20139d5a3/58492af6a50a4488b89ca5349c0a447e/FLAGf1f21c44f [2020-07-08 12:01:40,327 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:01:40,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/gcd01-1.c [2020-07-08 12:01:40,335 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20139d5a3/58492af6a50a4488b89ca5349c0a447e/FLAGf1f21c44f [2020-07-08 12:01:40,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20139d5a3/58492af6a50a4488b89ca5349c0a447e [2020-07-08 12:01:40,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:01:40,679 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:01:40,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:01:40,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:01:40,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:01:40,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:01:40" (1/1) ... [2020-07-08 12:01:40,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43efbe92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40, skipping insertion in model container [2020-07-08 12:01:40,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:01:40" (1/1) ... [2020-07-08 12:01:40,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:01:40,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:01:40,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:01:40,903 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:01:40,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:01:40,940 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:01:40,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40 WrapperNode [2020-07-08 12:01:40,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:01:40,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:01:40,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:01:40,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:01:40,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40" (1/1) ... [2020-07-08 12:01:40,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40" (1/1) ... [2020-07-08 12:01:40,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40" (1/1) ... [2020-07-08 12:01:40,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40" (1/1) ... [2020-07-08 12:01:40,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40" (1/1) ... [2020-07-08 12:01:40,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40" (1/1) ... [2020-07-08 12:01:40,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40" (1/1) ... [2020-07-08 12:01:40,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:01:40,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:01:40,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:01:40,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:01:40,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:01:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:01:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:01:41,114 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2020-07-08 12:01:41,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:01:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:01:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:01:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2020-07-08 12:01:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:01:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:01:41,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:01:41,507 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:01:41,508 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-08 12:01:41,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:01:41 BoogieIcfgContainer [2020-07-08 12:01:41,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:01:41,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:01:41,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:01:41,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:01:41,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:01:40" (1/3) ... [2020-07-08 12:01:41,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a32766e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:01:41, skipping insertion in model container [2020-07-08 12:01:41,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:01:40" (2/3) ... [2020-07-08 12:01:41,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a32766e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:01:41, skipping insertion in model container [2020-07-08 12:01:41,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:01:41" (3/3) ... [2020-07-08 12:01:41,528 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd01-1.c [2020-07-08 12:01:41,537 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:01:41,549 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:01:41,562 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:01:41,586 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:01:41,586 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:01:41,586 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:01:41,586 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:01:41,587 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:01:41,587 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:01:41,587 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:01:41,587 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:01:41,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-07-08 12:01:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-08 12:01:41,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:01:41,621 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:01:41,621 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:01:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:01:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1001932622, now seen corresponding path program 1 times [2020-07-08 12:01:41,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:01:41,637 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356537323] [2020-07-08 12:01:41,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:01:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:41,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-08 12:01:41,888 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {29#true} {29#true} #47#return; {29#true} is VALID [2020-07-08 12:01:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:41,967 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#true} ~y1 := #in~y1;~y2 := #in~y2; {39#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-08 12:01:41,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:41,970 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:41,972 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {34#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} #51#return; {30#false} is VALID [2020-07-08 12:01:41,973 INFO L263 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2020-07-08 12:01:41,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2020-07-08 12:01:41,975 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #47#return; {29#true} is VALID [2020-07-08 12:01:41,975 INFO L263 TraceCheckUtils]: 3: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2020-07-08 12:01:41,975 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {29#true} is VALID [2020-07-08 12:01:41,977 INFO L280 TraceCheckUtils]: 5: Hoare triple {29#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {33#(<= 1 main_~m~0)} is VALID [2020-07-08 12:01:41,979 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#(<= 1 main_~m~0)} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {34#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} is VALID [2020-07-08 12:01:41,979 INFO L263 TraceCheckUtils]: 7: Hoare triple {34#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} call #t~ret4 := gcd(~m~0, ~n~0); {29#true} is VALID [2020-07-08 12:01:41,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {29#true} ~y1 := #in~y1;~y2 := #in~y2; {39#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-08 12:01:41,982 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:41,983 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:41,986 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {34#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} #51#return; {30#false} is VALID [2020-07-08 12:01:41,987 INFO L280 TraceCheckUtils]: 12: Hoare triple {30#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {30#false} is VALID [2020-07-08 12:01:41,988 INFO L280 TraceCheckUtils]: 13: Hoare triple {30#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {30#false} is VALID [2020-07-08 12:01:41,988 INFO L280 TraceCheckUtils]: 14: Hoare triple {30#false} assume !false; {30#false} is VALID [2020-07-08 12:01:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:01:41,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356537323] [2020-07-08 12:01:41,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:01:41,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:01:41,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037252915] [2020-07-08 12:01:42,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-08 12:01:42,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:01:42,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:01:42,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:42,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:01:42,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:01:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:01:42,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:01:42,069 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 6 states. [2020-07-08 12:01:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:42,458 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2020-07-08 12:01:42,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:01:42,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-08 12:01:42,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:01:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:01:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-08 12:01:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:01:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2020-07-08 12:01:42,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2020-07-08 12:01:42,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:42,585 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:01:42,585 INFO L226 Difference]: Without dead ends: 24 [2020-07-08 12:01:42,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:01:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-08 12:01:42,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-08 12:01:42,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:01:42,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-08 12:01:42,634 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:01:42,635 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:01:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:42,641 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-08 12:01:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-08 12:01:42,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:42,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:42,642 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-08 12:01:42,643 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-08 12:01:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:42,647 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-07-08 12:01:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-08 12:01:42,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:42,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:42,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:01:42,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:01:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:01:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-08 12:01:42,655 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2020-07-08 12:01:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:01:42,655 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-08 12:01:42,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:01:42,656 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-08 12:01:42,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 12:01:42,657 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:01:42,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:01:42,657 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:01:42,658 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:01:42,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:01:42,658 INFO L82 PathProgramCache]: Analyzing trace with hash -423841111, now seen corresponding path program 1 times [2020-07-08 12:01:42,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:01:42,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310407779] [2020-07-08 12:01:42,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:01:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:42,737 INFO L280 TraceCheckUtils]: 0: Hoare triple {173#true} assume true; {173#true} is VALID [2020-07-08 12:01:42,737 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {173#true} {173#true} #47#return; {173#true} is VALID [2020-07-08 12:01:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:42,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {173#true} ~y1 := #in~y1;~y2 := #in~y2; {173#true} is VALID [2020-07-08 12:01:42,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {173#true} assume !(~y1 <= 0 || ~y2 <= 0); {184#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:42,781 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:42,782 INFO L280 TraceCheckUtils]: 3: Hoare triple {185#(<= 1 |gcd_#res|)} assume true; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:42,784 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {185#(<= 1 |gcd_#res|)} {173#true} #51#return; {182#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 12:01:42,784 INFO L263 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {173#true} is VALID [2020-07-08 12:01:42,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2020-07-08 12:01:42,785 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #47#return; {173#true} is VALID [2020-07-08 12:01:42,786 INFO L263 TraceCheckUtils]: 3: Hoare triple {173#true} call #t~ret5 := main(); {173#true} is VALID [2020-07-08 12:01:42,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {173#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {173#true} is VALID [2020-07-08 12:01:42,786 INFO L280 TraceCheckUtils]: 5: Hoare triple {173#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {173#true} is VALID [2020-07-08 12:01:42,787 INFO L280 TraceCheckUtils]: 6: Hoare triple {173#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {173#true} is VALID [2020-07-08 12:01:42,787 INFO L263 TraceCheckUtils]: 7: Hoare triple {173#true} call #t~ret4 := gcd(~m~0, ~n~0); {173#true} is VALID [2020-07-08 12:01:42,787 INFO L280 TraceCheckUtils]: 8: Hoare triple {173#true} ~y1 := #in~y1;~y2 := #in~y2; {173#true} is VALID [2020-07-08 12:01:42,788 INFO L280 TraceCheckUtils]: 9: Hoare triple {173#true} assume !(~y1 <= 0 || ~y2 <= 0); {184#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:42,790 INFO L280 TraceCheckUtils]: 10: Hoare triple {184#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:42,792 INFO L280 TraceCheckUtils]: 11: Hoare triple {185#(<= 1 |gcd_#res|)} assume true; {185#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:42,794 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {185#(<= 1 |gcd_#res|)} {173#true} #51#return; {182#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 12:01:42,796 INFO L280 TraceCheckUtils]: 13: Hoare triple {182#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {183#(<= 1 main_~z~0)} is VALID [2020-07-08 12:01:42,797 INFO L280 TraceCheckUtils]: 14: Hoare triple {183#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {174#false} is VALID [2020-07-08 12:01:42,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {174#false} assume !false; {174#false} is VALID [2020-07-08 12:01:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:01:42,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310407779] [2020-07-08 12:01:42,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:01:42,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:01:42,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739544577] [2020-07-08 12:01:42,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 12:01:42,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:01:42,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:01:42,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:42,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:01:42,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:01:42,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:01:42,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:01:42,827 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2020-07-08 12:01:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:43,000 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-08 12:01:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:01:43,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-08 12:01:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:01:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:01:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-08 12:01:43,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:01:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2020-07-08 12:01:43,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2020-07-08 12:01:43,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:43,077 INFO L225 Difference]: With dead ends: 30 [2020-07-08 12:01:43,078 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 12:01:43,079 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:01:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 12:01:43,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-08 12:01:43,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:01:43,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-08 12:01:43,103 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-08 12:01:43,104 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-08 12:01:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:43,110 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-08 12:01:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-08 12:01:43,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:43,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:43,112 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-08 12:01:43,114 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-08 12:01:43,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:43,123 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-08 12:01:43,124 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-08 12:01:43,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:43,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:43,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:01:43,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:01:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:01:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-07-08 12:01:43,140 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2020-07-08 12:01:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:01:43,141 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-07-08 12:01:43,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:01:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2020-07-08 12:01:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:01:43,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:01:43,143 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:01:43,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:01:43,143 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:01:43,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:01:43,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1280495258, now seen corresponding path program 1 times [2020-07-08 12:01:43,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:01:43,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381197654] [2020-07-08 12:01:43,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:01:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:43,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} assume true; {312#true} is VALID [2020-07-08 12:01:43,188 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {312#true} {312#true} #47#return; {312#true} is VALID [2020-07-08 12:01:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:43,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-08 12:01:43,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,283 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #43#return; {313#false} is VALID [2020-07-08 12:01:43,284 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {312#true} is VALID [2020-07-08 12:01:43,285 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#true} assume !(~y1 <= 0 || ~y2 <= 0); {328#(<= 1 gcd_~y2)} is VALID [2020-07-08 12:01:43,285 INFO L280 TraceCheckUtils]: 2: Hoare triple {328#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {328#(<= 1 gcd_~y2)} is VALID [2020-07-08 12:01:43,286 INFO L280 TraceCheckUtils]: 3: Hoare triple {328#(<= 1 gcd_~y2)} assume ~y1 > ~y2; {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} is VALID [2020-07-08 12:01:43,287 INFO L263 TraceCheckUtils]: 4: Hoare triple {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {312#true} is VALID [2020-07-08 12:01:43,288 INFO L280 TraceCheckUtils]: 5: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-08 12:01:43,289 INFO L280 TraceCheckUtils]: 6: Hoare triple {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,290 INFO L280 TraceCheckUtils]: 7: Hoare triple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,291 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #43#return; {313#false} is VALID [2020-07-08 12:01:43,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {313#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {313#false} is VALID [2020-07-08 12:01:43,292 INFO L280 TraceCheckUtils]: 10: Hoare triple {313#false} assume true; {313#false} is VALID [2020-07-08 12:01:43,293 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {313#false} {312#true} #51#return; {313#false} is VALID [2020-07-08 12:01:43,293 INFO L263 TraceCheckUtils]: 0: Hoare triple {312#true} call ULTIMATE.init(); {312#true} is VALID [2020-07-08 12:01:43,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {312#true} assume true; {312#true} is VALID [2020-07-08 12:01:43,294 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {312#true} {312#true} #47#return; {312#true} is VALID [2020-07-08 12:01:43,294 INFO L263 TraceCheckUtils]: 3: Hoare triple {312#true} call #t~ret5 := main(); {312#true} is VALID [2020-07-08 12:01:43,294 INFO L280 TraceCheckUtils]: 4: Hoare triple {312#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {312#true} is VALID [2020-07-08 12:01:43,295 INFO L280 TraceCheckUtils]: 5: Hoare triple {312#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {312#true} is VALID [2020-07-08 12:01:43,295 INFO L280 TraceCheckUtils]: 6: Hoare triple {312#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {312#true} is VALID [2020-07-08 12:01:43,295 INFO L263 TraceCheckUtils]: 7: Hoare triple {312#true} call #t~ret4 := gcd(~m~0, ~n~0); {312#true} is VALID [2020-07-08 12:01:43,296 INFO L280 TraceCheckUtils]: 8: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {312#true} is VALID [2020-07-08 12:01:43,297 INFO L280 TraceCheckUtils]: 9: Hoare triple {312#true} assume !(~y1 <= 0 || ~y2 <= 0); {328#(<= 1 gcd_~y2)} is VALID [2020-07-08 12:01:43,297 INFO L280 TraceCheckUtils]: 10: Hoare triple {328#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {328#(<= 1 gcd_~y2)} is VALID [2020-07-08 12:01:43,298 INFO L280 TraceCheckUtils]: 11: Hoare triple {328#(<= 1 gcd_~y2)} assume ~y1 > ~y2; {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} is VALID [2020-07-08 12:01:43,299 INFO L263 TraceCheckUtils]: 12: Hoare triple {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {312#true} is VALID [2020-07-08 12:01:43,299 INFO L280 TraceCheckUtils]: 13: Hoare triple {312#true} ~y1 := #in~y1;~y2 := #in~y2; {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-08 12:01:43,300 INFO L280 TraceCheckUtils]: 14: Hoare triple {334#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,301 INFO L280 TraceCheckUtils]: 15: Hoare triple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,303 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {335#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {329#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #43#return; {313#false} is VALID [2020-07-08 12:01:43,303 INFO L280 TraceCheckUtils]: 17: Hoare triple {313#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {313#false} is VALID [2020-07-08 12:01:43,303 INFO L280 TraceCheckUtils]: 18: Hoare triple {313#false} assume true; {313#false} is VALID [2020-07-08 12:01:43,303 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {313#false} {312#true} #51#return; {313#false} is VALID [2020-07-08 12:01:43,304 INFO L280 TraceCheckUtils]: 20: Hoare triple {313#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {313#false} is VALID [2020-07-08 12:01:43,304 INFO L280 TraceCheckUtils]: 21: Hoare triple {313#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {313#false} is VALID [2020-07-08 12:01:43,304 INFO L280 TraceCheckUtils]: 22: Hoare triple {313#false} assume !false; {313#false} is VALID [2020-07-08 12:01:43,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:01:43,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381197654] [2020-07-08 12:01:43,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:01:43,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:01:43,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780705312] [2020-07-08 12:01:43,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-08 12:01:43,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:01:43,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:01:43,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:43,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:01:43,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:01:43,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:01:43,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:01:43,338 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 6 states. [2020-07-08 12:01:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:43,691 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-07-08 12:01:43,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:01:43,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-08 12:01:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:01:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:01:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-08 12:01:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:01:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2020-07-08 12:01:43,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2020-07-08 12:01:43,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:43,771 INFO L225 Difference]: With dead ends: 36 [2020-07-08 12:01:43,772 INFO L226 Difference]: Without dead ends: 28 [2020-07-08 12:01:43,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:01:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-08 12:01:43,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-08 12:01:43,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:01:43,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2020-07-08 12:01:43,792 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2020-07-08 12:01:43,793 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2020-07-08 12:01:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:43,796 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-08 12:01:43,796 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-08 12:01:43,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:43,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:43,797 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2020-07-08 12:01:43,798 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2020-07-08 12:01:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:43,801 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-08 12:01:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-08 12:01:43,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:43,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:43,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:01:43,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:01:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-08 12:01:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-07-08 12:01:43,806 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 23 [2020-07-08 12:01:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:01:43,806 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-07-08 12:01:43,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:01:43,806 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-08 12:01:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 12:01:43,808 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:01:43,808 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:01:43,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:01:43,808 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:01:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:01:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1668712292, now seen corresponding path program 1 times [2020-07-08 12:01:43,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:01:43,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755389596] [2020-07-08 12:01:43,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:01:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:43,847 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-08 12:01:43,848 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {478#true} {478#true} #47#return; {478#true} is VALID [2020-07-08 12:01:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:43,952 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-08 12:01:43,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,956 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #45#return; {479#false} is VALID [2020-07-08 12:01:43,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {478#true} is VALID [2020-07-08 12:01:43,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#true} assume !(~y1 <= 0 || ~y2 <= 0); {494#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:43,958 INFO L280 TraceCheckUtils]: 2: Hoare triple {494#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {495#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} is VALID [2020-07-08 12:01:43,959 INFO L280 TraceCheckUtils]: 3: Hoare triple {495#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} assume !(~y1 > ~y2); {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} is VALID [2020-07-08 12:01:43,959 INFO L263 TraceCheckUtils]: 4: Hoare triple {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {478#true} is VALID [2020-07-08 12:01:43,960 INFO L280 TraceCheckUtils]: 5: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-08 12:01:43,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,961 INFO L280 TraceCheckUtils]: 7: Hoare triple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,963 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #45#return; {479#false} is VALID [2020-07-08 12:01:43,963 INFO L280 TraceCheckUtils]: 9: Hoare triple {479#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {479#false} is VALID [2020-07-08 12:01:43,963 INFO L280 TraceCheckUtils]: 10: Hoare triple {479#false} assume true; {479#false} is VALID [2020-07-08 12:01:43,964 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {479#false} {478#true} #51#return; {479#false} is VALID [2020-07-08 12:01:43,964 INFO L263 TraceCheckUtils]: 0: Hoare triple {478#true} call ULTIMATE.init(); {478#true} is VALID [2020-07-08 12:01:43,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#true} assume true; {478#true} is VALID [2020-07-08 12:01:43,965 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {478#true} {478#true} #47#return; {478#true} is VALID [2020-07-08 12:01:43,965 INFO L263 TraceCheckUtils]: 3: Hoare triple {478#true} call #t~ret5 := main(); {478#true} is VALID [2020-07-08 12:01:43,965 INFO L280 TraceCheckUtils]: 4: Hoare triple {478#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {478#true} is VALID [2020-07-08 12:01:43,966 INFO L280 TraceCheckUtils]: 5: Hoare triple {478#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {478#true} is VALID [2020-07-08 12:01:43,966 INFO L280 TraceCheckUtils]: 6: Hoare triple {478#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {478#true} is VALID [2020-07-08 12:01:43,966 INFO L263 TraceCheckUtils]: 7: Hoare triple {478#true} call #t~ret4 := gcd(~m~0, ~n~0); {478#true} is VALID [2020-07-08 12:01:43,967 INFO L280 TraceCheckUtils]: 8: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {478#true} is VALID [2020-07-08 12:01:43,967 INFO L280 TraceCheckUtils]: 9: Hoare triple {478#true} assume !(~y1 <= 0 || ~y2 <= 0); {494#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:43,968 INFO L280 TraceCheckUtils]: 10: Hoare triple {494#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {495#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} is VALID [2020-07-08 12:01:43,969 INFO L280 TraceCheckUtils]: 11: Hoare triple {495#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} assume !(~y1 > ~y2); {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} is VALID [2020-07-08 12:01:43,970 INFO L263 TraceCheckUtils]: 12: Hoare triple {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {478#true} is VALID [2020-07-08 12:01:43,970 INFO L280 TraceCheckUtils]: 13: Hoare triple {478#true} ~y1 := #in~y1;~y2 := #in~y2; {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID [2020-07-08 12:01:43,971 INFO L280 TraceCheckUtils]: 14: Hoare triple {501#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0;#res := 0; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,972 INFO L280 TraceCheckUtils]: 15: Hoare triple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID [2020-07-08 12:01:43,973 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {502#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {496#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #45#return; {479#false} is VALID [2020-07-08 12:01:43,974 INFO L280 TraceCheckUtils]: 17: Hoare triple {479#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {479#false} is VALID [2020-07-08 12:01:43,974 INFO L280 TraceCheckUtils]: 18: Hoare triple {479#false} assume true; {479#false} is VALID [2020-07-08 12:01:43,974 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {479#false} {478#true} #51#return; {479#false} is VALID [2020-07-08 12:01:43,974 INFO L280 TraceCheckUtils]: 20: Hoare triple {479#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {479#false} is VALID [2020-07-08 12:01:43,975 INFO L280 TraceCheckUtils]: 21: Hoare triple {479#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {479#false} is VALID [2020-07-08 12:01:43,975 INFO L280 TraceCheckUtils]: 22: Hoare triple {479#false} assume !false; {479#false} is VALID [2020-07-08 12:01:43,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 12:01:43,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755389596] [2020-07-08 12:01:43,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:01:43,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:01:43,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994933924] [2020-07-08 12:01:43,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-08 12:01:43,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:01:43,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:01:44,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:44,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:01:44,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:01:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:01:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:01:44,017 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 7 states. [2020-07-08 12:01:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:44,405 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-08 12:01:44,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:01:44,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-08 12:01:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:01:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:01:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-08 12:01:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:01:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2020-07-08 12:01:44,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2020-07-08 12:01:44,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:44,506 INFO L225 Difference]: With dead ends: 36 [2020-07-08 12:01:44,506 INFO L226 Difference]: Without dead ends: 26 [2020-07-08 12:01:44,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:01:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-08 12:01:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-08 12:01:44,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:01:44,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2020-07-08 12:01:44,542 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2020-07-08 12:01:44,542 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2020-07-08 12:01:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:44,545 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-08 12:01:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-08 12:01:44,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:44,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:44,546 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2020-07-08 12:01:44,546 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2020-07-08 12:01:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:44,548 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-08 12:01:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-08 12:01:44,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:44,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:44,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:01:44,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:01:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:01:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-08 12:01:44,552 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 23 [2020-07-08 12:01:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:01:44,552 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-08 12:01:44,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:01:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2020-07-08 12:01:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:01:44,554 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:01:44,554 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:01:44,554 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:01:44,555 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:01:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:01:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1139697511, now seen corresponding path program 1 times [2020-07-08 12:01:44,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:01:44,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498702822] [2020-07-08 12:01:44,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:01:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:44,640 INFO L280 TraceCheckUtils]: 0: Hoare triple {641#true} assume true; {641#true} is VALID [2020-07-08 12:01:44,641 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {641#true} {641#true} #47#return; {641#true} is VALID [2020-07-08 12:01:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:44,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-08 12:01:44,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {667#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:44,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,710 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #43#return; {665#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 12:01:44,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-08 12:01:44,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {641#true} is VALID [2020-07-08 12:01:44,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {641#true} assume !(~y1 == ~y2); {641#true} is VALID [2020-07-08 12:01:44,711 INFO L280 TraceCheckUtils]: 3: Hoare triple {641#true} assume ~y1 > ~y2; {641#true} is VALID [2020-07-08 12:01:44,711 INFO L263 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {641#true} is VALID [2020-07-08 12:01:44,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-08 12:01:44,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {667#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:44,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {667#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,714 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #43#return; {665#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 12:01:44,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {665#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,716 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #51#return; {658#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 12:01:44,716 INFO L263 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2020-07-08 12:01:44,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {641#true} assume true; {641#true} is VALID [2020-07-08 12:01:44,717 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {641#true} {641#true} #47#return; {641#true} is VALID [2020-07-08 12:01:44,717 INFO L263 TraceCheckUtils]: 3: Hoare triple {641#true} call #t~ret5 := main(); {641#true} is VALID [2020-07-08 12:01:44,717 INFO L280 TraceCheckUtils]: 4: Hoare triple {641#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {641#true} is VALID [2020-07-08 12:01:44,717 INFO L280 TraceCheckUtils]: 5: Hoare triple {641#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {641#true} is VALID [2020-07-08 12:01:44,717 INFO L280 TraceCheckUtils]: 6: Hoare triple {641#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {641#true} is VALID [2020-07-08 12:01:44,717 INFO L263 TraceCheckUtils]: 7: Hoare triple {641#true} call #t~ret4 := gcd(~m~0, ~n~0); {641#true} is VALID [2020-07-08 12:01:44,718 INFO L280 TraceCheckUtils]: 8: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-08 12:01:44,718 INFO L280 TraceCheckUtils]: 9: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {641#true} is VALID [2020-07-08 12:01:44,718 INFO L280 TraceCheckUtils]: 10: Hoare triple {641#true} assume !(~y1 == ~y2); {641#true} is VALID [2020-07-08 12:01:44,718 INFO L280 TraceCheckUtils]: 11: Hoare triple {641#true} assume ~y1 > ~y2; {641#true} is VALID [2020-07-08 12:01:44,718 INFO L263 TraceCheckUtils]: 12: Hoare triple {641#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {641#true} is VALID [2020-07-08 12:01:44,719 INFO L280 TraceCheckUtils]: 13: Hoare triple {641#true} ~y1 := #in~y1;~y2 := #in~y2; {641#true} is VALID [2020-07-08 12:01:44,719 INFO L280 TraceCheckUtils]: 14: Hoare triple {641#true} assume !(~y1 <= 0 || ~y2 <= 0); {667#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:44,720 INFO L280 TraceCheckUtils]: 15: Hoare triple {667#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,720 INFO L280 TraceCheckUtils]: 16: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,721 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #43#return; {665#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 12:01:44,722 INFO L280 TraceCheckUtils]: 18: Hoare triple {665#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,722 INFO L280 TraceCheckUtils]: 19: Hoare triple {666#(<= 1 |gcd_#res|)} assume true; {666#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:44,723 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {666#(<= 1 |gcd_#res|)} {641#true} #51#return; {658#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 12:01:44,723 INFO L280 TraceCheckUtils]: 21: Hoare triple {658#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {659#(<= 1 main_~z~0)} is VALID [2020-07-08 12:01:44,724 INFO L280 TraceCheckUtils]: 22: Hoare triple {659#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {642#false} is VALID [2020-07-08 12:01:44,724 INFO L280 TraceCheckUtils]: 23: Hoare triple {642#false} assume !false; {642#false} is VALID [2020-07-08 12:01:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 12:01:44,725 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498702822] [2020-07-08 12:01:44,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:01:44,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:01:44,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218140905] [2020-07-08 12:01:44,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 12:01:44,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:01:44,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:01:44,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:44,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:01:44,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:01:44,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:01:44,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:01:44,762 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 7 states. [2020-07-08 12:01:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:44,959 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-08 12:01:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:01:44,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 12:01:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:01:44,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:01:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-08 12:01:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:01:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-08 12:01:44,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-08 12:01:45,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:45,011 INFO L225 Difference]: With dead ends: 31 [2020-07-08 12:01:45,012 INFO L226 Difference]: Without dead ends: 27 [2020-07-08 12:01:45,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:01:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-08 12:01:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-08 12:01:45,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:01:45,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-08 12:01:45,025 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-08 12:01:45,025 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-08 12:01:45,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:45,028 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-08 12:01:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-08 12:01:45,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:45,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:45,029 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-08 12:01:45,029 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-08 12:01:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:45,032 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-08 12:01:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-08 12:01:45,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:45,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:45,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:01:45,033 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:01:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:01:45,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-08 12:01:45,035 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2020-07-08 12:01:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:01:45,035 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-08 12:01:45,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:01:45,035 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-08 12:01:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-08 12:01:45,036 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:01:45,036 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:01:45,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:01:45,037 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:01:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:01:45,037 INFO L82 PathProgramCache]: Analyzing trace with hash 99153721, now seen corresponding path program 1 times [2020-07-08 12:01:45,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:01:45,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151706177] [2020-07-08 12:01:45,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:01:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:45,075 INFO L280 TraceCheckUtils]: 0: Hoare triple {800#true} assume true; {800#true} is VALID [2020-07-08 12:01:45,076 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {800#true} {800#true} #47#return; {800#true} is VALID [2020-07-08 12:01:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:45,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-08 12:01:45,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {819#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,151 INFO L280 TraceCheckUtils]: 3: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,152 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {826#(<= 1 |gcd_#res|)} {819#(<= 1 gcd_~y1)} #45#return; {825#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-08 12:01:45,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-08 12:01:45,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,155 INFO L280 TraceCheckUtils]: 3: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,155 INFO L263 TraceCheckUtils]: 4: Hoare triple {819#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {800#true} is VALID [2020-07-08 12:01:45,155 INFO L280 TraceCheckUtils]: 5: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-08 12:01:45,156 INFO L280 TraceCheckUtils]: 6: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {819#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,159 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {826#(<= 1 |gcd_#res|)} {819#(<= 1 gcd_~y1)} #45#return; {825#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-08 12:01:45,160 INFO L280 TraceCheckUtils]: 10: Hoare triple {825#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,161 INFO L280 TraceCheckUtils]: 11: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,162 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {826#(<= 1 |gcd_#res|)} {800#true} #51#return; {817#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 12:01:45,162 INFO L263 TraceCheckUtils]: 0: Hoare triple {800#true} call ULTIMATE.init(); {800#true} is VALID [2020-07-08 12:01:45,163 INFO L280 TraceCheckUtils]: 1: Hoare triple {800#true} assume true; {800#true} is VALID [2020-07-08 12:01:45,163 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {800#true} {800#true} #47#return; {800#true} is VALID [2020-07-08 12:01:45,163 INFO L263 TraceCheckUtils]: 3: Hoare triple {800#true} call #t~ret5 := main(); {800#true} is VALID [2020-07-08 12:01:45,163 INFO L280 TraceCheckUtils]: 4: Hoare triple {800#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {800#true} is VALID [2020-07-08 12:01:45,164 INFO L280 TraceCheckUtils]: 5: Hoare triple {800#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {800#true} is VALID [2020-07-08 12:01:45,164 INFO L280 TraceCheckUtils]: 6: Hoare triple {800#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {800#true} is VALID [2020-07-08 12:01:45,164 INFO L263 TraceCheckUtils]: 7: Hoare triple {800#true} call #t~ret4 := gcd(~m~0, ~n~0); {800#true} is VALID [2020-07-08 12:01:45,164 INFO L280 TraceCheckUtils]: 8: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-08 12:01:45,165 INFO L280 TraceCheckUtils]: 9: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,166 INFO L280 TraceCheckUtils]: 10: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,167 INFO L280 TraceCheckUtils]: 11: Hoare triple {819#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {819#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,167 INFO L263 TraceCheckUtils]: 12: Hoare triple {819#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {800#true} is VALID [2020-07-08 12:01:45,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {800#true} ~y1 := #in~y1;~y2 := #in~y2; {800#true} is VALID [2020-07-08 12:01:45,168 INFO L280 TraceCheckUtils]: 14: Hoare triple {800#true} assume !(~y1 <= 0 || ~y2 <= 0); {819#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,169 INFO L280 TraceCheckUtils]: 15: Hoare triple {819#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,169 INFO L280 TraceCheckUtils]: 16: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,171 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {826#(<= 1 |gcd_#res|)} {819#(<= 1 gcd_~y1)} #45#return; {825#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-08 12:01:45,171 INFO L280 TraceCheckUtils]: 18: Hoare triple {825#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,172 INFO L280 TraceCheckUtils]: 19: Hoare triple {826#(<= 1 |gcd_#res|)} assume true; {826#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,173 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {826#(<= 1 |gcd_#res|)} {800#true} #51#return; {817#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 12:01:45,174 INFO L280 TraceCheckUtils]: 21: Hoare triple {817#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {818#(<= 1 main_~z~0)} is VALID [2020-07-08 12:01:45,175 INFO L280 TraceCheckUtils]: 22: Hoare triple {818#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {801#false} is VALID [2020-07-08 12:01:45,175 INFO L280 TraceCheckUtils]: 23: Hoare triple {801#false} assume !false; {801#false} is VALID [2020-07-08 12:01:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-08 12:01:45,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151706177] [2020-07-08 12:01:45,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:01:45,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:01:45,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842592619] [2020-07-08 12:01:45,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 12:01:45,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:01:45,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:01:45,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:45,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:01:45,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:01:45,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:01:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:01:45,203 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 7 states. [2020-07-08 12:01:45,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:45,397 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2020-07-08 12:01:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:01:45,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-07-08 12:01:45,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:01:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:01:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-08 12:01:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:01:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2020-07-08 12:01:45,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2020-07-08 12:01:45,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:45,457 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:01:45,457 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:01:45,458 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:01:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:01:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-08 12:01:45,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:01:45,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-08 12:01:45,486 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:01:45,486 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:01:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:45,490 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-08 12:01:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-08 12:01:45,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:45,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:45,491 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-08 12:01:45,491 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-08 12:01:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:45,495 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-08 12:01:45,495 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-08 12:01:45,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:45,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:45,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:01:45,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:01:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-08 12:01:45,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-07-08 12:01:45,500 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 24 [2020-07-08 12:01:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:01:45,500 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-07-08 12:01:45,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:01:45,500 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-08 12:01:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-08 12:01:45,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:01:45,504 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:01:45,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:01:45,505 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:01:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:01:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash 10057033, now seen corresponding path program 1 times [2020-07-08 12:01:45,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:01:45,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819276340] [2020-07-08 12:01:45,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:01:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:45,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} assume true; {973#true} is VALID [2020-07-08 12:01:45,601 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {973#true} {973#true} #47#return; {973#true} is VALID [2020-07-08 12:01:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:01:45,686 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-08 12:01:45,687 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,687 INFO L280 TraceCheckUtils]: 2: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,688 INFO L280 TraceCheckUtils]: 3: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,690 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 12:01:45,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-08 12:01:45,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-08 12:01:45,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-08 12:01:45,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {973#true} assume ~y1 > ~y2; {973#true} is VALID [2020-07-08 12:01:45,691 INFO L263 TraceCheckUtils]: 4: Hoare triple {973#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {973#true} is VALID [2020-07-08 12:01:45,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-08 12:01:45,692 INFO L280 TraceCheckUtils]: 6: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,693 INFO L280 TraceCheckUtils]: 7: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,694 INFO L280 TraceCheckUtils]: 8: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,695 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 12:01:45,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {1020#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,698 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #45#return; {1013#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-08 12:01:45,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-08 12:01:45,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-08 12:01:45,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-08 12:01:45,700 INFO L280 TraceCheckUtils]: 3: Hoare triple {973#true} assume !(~y1 > ~y2); {973#true} is VALID [2020-07-08 12:01:45,700 INFO L263 TraceCheckUtils]: 4: Hoare triple {973#true} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {973#true} is VALID [2020-07-08 12:01:45,700 INFO L280 TraceCheckUtils]: 5: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-08 12:01:45,700 INFO L280 TraceCheckUtils]: 6: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-08 12:01:45,701 INFO L280 TraceCheckUtils]: 7: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-08 12:01:45,701 INFO L280 TraceCheckUtils]: 8: Hoare triple {973#true} assume ~y1 > ~y2; {973#true} is VALID [2020-07-08 12:01:45,701 INFO L263 TraceCheckUtils]: 9: Hoare triple {973#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {973#true} is VALID [2020-07-08 12:01:45,701 INFO L280 TraceCheckUtils]: 10: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-08 12:01:45,702 INFO L280 TraceCheckUtils]: 11: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,703 INFO L280 TraceCheckUtils]: 12: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,704 INFO L280 TraceCheckUtils]: 13: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,705 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 12:01:45,706 INFO L280 TraceCheckUtils]: 15: Hoare triple {1020#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,707 INFO L280 TraceCheckUtils]: 16: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,708 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #45#return; {1013#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-08 12:01:45,709 INFO L280 TraceCheckUtils]: 18: Hoare triple {1013#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,710 INFO L280 TraceCheckUtils]: 19: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,711 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #51#return; {998#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 12:01:45,712 INFO L263 TraceCheckUtils]: 0: Hoare triple {973#true} call ULTIMATE.init(); {973#true} is VALID [2020-07-08 12:01:45,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {973#true} assume true; {973#true} is VALID [2020-07-08 12:01:45,712 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {973#true} {973#true} #47#return; {973#true} is VALID [2020-07-08 12:01:45,712 INFO L263 TraceCheckUtils]: 3: Hoare triple {973#true} call #t~ret5 := main(); {973#true} is VALID [2020-07-08 12:01:45,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {973#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~m~0 := #t~nondet2;havoc #t~nondet2; {973#true} is VALID [2020-07-08 12:01:45,713 INFO L280 TraceCheckUtils]: 5: Hoare triple {973#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647);assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~n~0 := #t~nondet3;havoc #t~nondet3; {973#true} is VALID [2020-07-08 12:01:45,713 INFO L280 TraceCheckUtils]: 6: Hoare triple {973#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {973#true} is VALID [2020-07-08 12:01:45,713 INFO L263 TraceCheckUtils]: 7: Hoare triple {973#true} call #t~ret4 := gcd(~m~0, ~n~0); {973#true} is VALID [2020-07-08 12:01:45,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-08 12:01:45,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-08 12:01:45,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-08 12:01:45,714 INFO L280 TraceCheckUtils]: 11: Hoare triple {973#true} assume !(~y1 > ~y2); {973#true} is VALID [2020-07-08 12:01:45,715 INFO L263 TraceCheckUtils]: 12: Hoare triple {973#true} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {973#true} is VALID [2020-07-08 12:01:45,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-08 12:01:45,715 INFO L280 TraceCheckUtils]: 14: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {973#true} is VALID [2020-07-08 12:01:45,715 INFO L280 TraceCheckUtils]: 15: Hoare triple {973#true} assume !(~y1 == ~y2); {973#true} is VALID [2020-07-08 12:01:45,716 INFO L280 TraceCheckUtils]: 16: Hoare triple {973#true} assume ~y1 > ~y2; {973#true} is VALID [2020-07-08 12:01:45,716 INFO L263 TraceCheckUtils]: 17: Hoare triple {973#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {973#true} is VALID [2020-07-08 12:01:45,716 INFO L280 TraceCheckUtils]: 18: Hoare triple {973#true} ~y1 := #in~y1;~y2 := #in~y2; {973#true} is VALID [2020-07-08 12:01:45,717 INFO L280 TraceCheckUtils]: 19: Hoare triple {973#true} assume !(~y1 <= 0 || ~y2 <= 0); {1021#(<= 1 gcd_~y1)} is VALID [2020-07-08 12:01:45,718 INFO L280 TraceCheckUtils]: 20: Hoare triple {1021#(<= 1 gcd_~y1)} assume ~y1 == ~y2;#res := ~y1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,719 INFO L280 TraceCheckUtils]: 21: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,720 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #43#return; {1020#(<= 1 |gcd_#t~ret0|)} is VALID [2020-07-08 12:01:45,721 INFO L280 TraceCheckUtils]: 23: Hoare triple {1020#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := #t~ret0;havoc #t~ret0; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,722 INFO L280 TraceCheckUtils]: 24: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,723 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #45#return; {1013#(<= 1 |gcd_#t~ret1|)} is VALID [2020-07-08 12:01:45,724 INFO L280 TraceCheckUtils]: 26: Hoare triple {1013#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;#res := #t~ret1;havoc #t~ret1; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,724 INFO L280 TraceCheckUtils]: 27: Hoare triple {1014#(<= 1 |gcd_#res|)} assume true; {1014#(<= 1 |gcd_#res|)} is VALID [2020-07-08 12:01:45,726 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1014#(<= 1 |gcd_#res|)} {973#true} #51#return; {998#(<= 1 |main_#t~ret4|)} is VALID [2020-07-08 12:01:45,726 INFO L280 TraceCheckUtils]: 29: Hoare triple {998#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;~z~0 := #t~ret4;havoc #t~ret4; {999#(<= 1 main_~z~0)} is VALID [2020-07-08 12:01:45,727 INFO L280 TraceCheckUtils]: 30: Hoare triple {999#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {974#false} is VALID [2020-07-08 12:01:45,727 INFO L280 TraceCheckUtils]: 31: Hoare triple {974#false} assume !false; {974#false} is VALID [2020-07-08 12:01:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-08 12:01:45,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819276340] [2020-07-08 12:01:45,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:01:45,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 12:01:45,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812398052] [2020-07-08 12:01:45,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-08 12:01:45,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:01:45,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:01:45,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:45,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:01:45,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:01:45,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:01:45,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:01:45,762 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 8 states. [2020-07-08 12:01:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:45,970 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-08 12:01:45,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:01:45,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-07-08 12:01:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:01:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:01:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-08 12:01:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:01:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-08 12:01:45,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2020-07-08 12:01:46,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:01:46,011 INFO L225 Difference]: With dead ends: 30 [2020-07-08 12:01:46,011 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:01:46,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:01:46,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:01:46,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:01:46,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:01:46,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:01:46,013 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:01:46,013 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:01:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:46,014 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:01:46,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:01:46,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:46,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:46,015 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:01:46,015 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:01:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:01:46,015 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:01:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:01:46,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:46,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:01:46,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:01:46,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:01:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:01:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:01:46,017 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2020-07-08 12:01:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:01:46,017 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:01:46,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:01:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:01:46,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:01:46,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 12:01:46,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:01:46,128 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:01:46,128 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:01:46,128 INFO L268 CegarLoopResult]: For program point gcdFINAL(lines 15 26) no Hoare annotation was computed. [2020-07-08 12:01:46,129 INFO L268 CegarLoopResult]: For program point gcdEXIT(lines 15 26) no Hoare annotation was computed. [2020-07-08 12:01:46,129 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= 1 gcd_~y1) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2)) [2020-07-08 12:01:46,129 INFO L268 CegarLoopResult]: For program point L25-1(line 25) no Hoare annotation was computed. [2020-07-08 12:01:46,129 INFO L271 CegarLoopResult]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true [2020-07-08 12:01:46,129 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|)) [2020-07-08 12:01:46,130 INFO L268 CegarLoopResult]: For program point L22(lines 22 24) no Hoare annotation was computed. [2020-07-08 12:01:46,130 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-08 12:01:46,130 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-08 12:01:46,130 INFO L268 CegarLoopResult]: For program point L16(lines 16 18) no Hoare annotation was computed. [2020-07-08 12:01:46,130 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:01:46,130 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:01:46,130 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:01:46,130 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:01:46,131 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-07-08 12:01:46,131 INFO L268 CegarLoopResult]: For program point L30(lines 30 32) no Hoare annotation was computed. [2020-07-08 12:01:46,131 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 28 43) the Hoare annotation is: true [2020-07-08 12:01:46,131 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 28 43) no Hoare annotation was computed. [2020-07-08 12:01:46,131 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-08 12:01:46,132 INFO L268 CegarLoopResult]: For program point L38(lines 38 42) no Hoare annotation was computed. [2020-07-08 12:01:46,132 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0)) [2020-07-08 12:01:46,133 INFO L268 CegarLoopResult]: For program point L38-1(lines 28 43) no Hoare annotation was computed. [2020-07-08 12:01:46,133 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-07-08 12:01:46,133 INFO L268 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2020-07-08 12:01:46,138 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:01:46,138 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-08 12:01:46,138 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 12:01:46,139 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:01:46,139 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:01:46,139 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-08 12:01:46,139 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-08 12:01:46,139 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 12:01:46,139 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-08 12:01:46,139 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:01:46,139 WARN L170 areAnnotationChecker]: gcdFINAL has no Hoare annotation [2020-07-08 12:01:46,140 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 12:01:46,140 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-08 12:01:46,140 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 12:01:46,140 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:01:46,140 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-08 12:01:46,140 WARN L170 areAnnotationChecker]: gcdEXIT has no Hoare annotation [2020-07-08 12:01:46,140 WARN L170 areAnnotationChecker]: gcdEXIT has no Hoare annotation [2020-07-08 12:01:46,140 WARN L170 areAnnotationChecker]: gcdEXIT has no Hoare annotation [2020-07-08 12:01:46,140 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:01:46,141 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:01:46,141 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:01:46,141 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 12:01:46,141 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:01:46,141 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-08 12:01:46,141 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 12:01:46,141 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:01:46,142 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2020-07-08 12:01:46,143 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:01:46,143 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 12:01:46,143 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:01:46,143 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:01:46,143 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:01:46,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:01:46 BoogieIcfgContainer [2020-07-08 12:01:46,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:01:46,151 INFO L168 Benchmark]: Toolchain (without parser) took 5471.92 ms. Allocated memory was 137.4 MB in the beginning and 287.3 MB in the end (delta: 149.9 MB). Free memory was 102.6 MB in the beginning and 157.0 MB in the end (delta: -54.4 MB). Peak memory consumption was 95.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:01:46,152 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:01:46,153 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.12 ms. Allocated memory is still 137.4 MB. Free memory was 102.2 MB in the beginning and 92.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:01:46,153 INFO L168 Benchmark]: Boogie Preprocessor took 32.77 ms. Allocated memory is still 137.4 MB. Free memory was 92.2 MB in the beginning and 90.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:01:46,154 INFO L168 Benchmark]: RCFGBuilder took 540.53 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 90.9 MB in the beginning and 160.3 MB in the end (delta: -69.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:01:46,155 INFO L168 Benchmark]: TraceAbstraction took 4632.29 ms. Allocated memory was 201.3 MB in the beginning and 287.3 MB in the end (delta: 86.0 MB). Free memory was 159.3 MB in the beginning and 157.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:01:46,158 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 261.12 ms. Allocated memory is still 137.4 MB. Free memory was 102.2 MB in the beginning and 92.2 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.77 ms. Allocated memory is still 137.4 MB. Free memory was 92.2 MB in the beginning and 90.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 540.53 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 90.9 MB in the beginning and 160.3 MB in the end (delta: -69.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4632.29 ms. Allocated memory was 201.3 MB in the beginning and 287.3 MB in the end (delta: 86.0 MB). Free memory was 159.3 MB in the beginning and 157.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.4s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 142 SDtfs, 89 SDslu, 488 SDs, 0 SdLazy, 281 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 14 NumberOfFragments, 40 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 6864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 34/34 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...