/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/gcd01-1.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-267fbe0
[2020-07-18 04:40:34,154 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-07-18 04:40:34,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-18 04:40:34,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-18 04:40:34,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-18 04:40:34,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-18 04:40:34,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-18 04:40:34,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-18 04:40:34,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-18 04:40:34,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-18 04:40:34,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-07-18 04:40:34,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-18 04:40:34,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-18 04:40:34,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-18 04:40:34,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-18 04:40:34,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-18 04:40:34,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-18 04:40:34,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-18 04:40:34,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-18 04:40:34,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-18 04:40:34,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-18 04:40:34,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-18 04:40:34,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-07-18 04:40:34,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-18 04:40:34,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-18 04:40:34,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-18 04:40:34,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-18 04:40:34,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-18 04:40:34,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-18 04:40:34,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-18 04:40:34,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-18 04:40:34,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-18 04:40:34,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-18 04:40:34,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-18 04:40:34,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-18 04:40:34,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-18 04:40:34,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-18 04:40:34,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-18 04:40:34,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-18 04:40:34,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-18 04:40:34,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-07-18 04:40:34,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf
[2020-07-18 04:40:34,268 INFO L113 SettingsManager]: Loading preferences was successful
[2020-07-18 04:40:34,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-18 04:40:34,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-18 04:40:34,270 INFO L138 SettingsManager]: * sizeof long=4
[2020-07-18 04:40:34,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-07-18 04:40:34,270 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-07-18 04:40:34,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-07-18 04:40:34,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-07-18 04:40:34,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-18 04:40:34,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-07-18 04:40:34,271 INFO L138 SettingsManager]: * sizeof long double=12
[2020-07-18 04:40:34,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-07-18 04:40:34,272 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-07-18 04:40:34,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-07-18 04:40:34,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-18 04:40:34,272 INFO L138 SettingsManager]: * Size of a code block=SingleStatement
[2020-07-18 04:40:34,272 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-07-18 04:40:34,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-07-18 04:40:34,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-18 04:40:34,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-18 04:40:34,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-07-18 04:40:34,273 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-18 04:40:34,274 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true
[2020-07-18 04:40:34,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-18 04:40:34,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-18 04:40:34,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-18 04:40:34,558 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-07-18 04:40:34,559 INFO L275 PluginConnector]: CDTParser initialized
[2020-07-18 04:40:34,559 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-18 04:40:34,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21e7d7b0/b6146d5e5ecf4990a5ce88e56c1f2c96/FLAG8cf380e12
[2020-07-18 04:40:35,079 INFO L306 CDTParser]: Found 1 translation units.
[2020-07-18 04:40:35,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/gcd01-1.c
[2020-07-18 04:40:35,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21e7d7b0/b6146d5e5ecf4990a5ce88e56c1f2c96/FLAG8cf380e12
[2020-07-18 04:40:35,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21e7d7b0/b6146d5e5ecf4990a5ce88e56c1f2c96
[2020-07-18 04:40:35,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-18 04:40:35,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-18 04:40:35,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-18 04:40:35,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-18 04:40:35,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-18 04:40:35,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:40:35" (1/1) ...
[2020-07-18 04:40:35,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b63b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35, skipping insertion in model container
[2020-07-18 04:40:35,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 04:40:35" (1/1) ...
[2020-07-18 04:40:35,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-07-18 04:40:35,533 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-07-18 04:40:35,706 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-18 04:40:35,712 INFO L203 MainTranslator]: Completed pre-run
[2020-07-18 04:40:35,731 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-18 04:40:35,746 INFO L208 MainTranslator]: Completed translation
[2020-07-18 04:40:35,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35 WrapperNode
[2020-07-18 04:40:35,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-18 04:40:35,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-18 04:40:35,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-18 04:40:35,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-07-18 04:40:35,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35" (1/1) ...
[2020-07-18 04:40:35,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35" (1/1) ...
[2020-07-18 04:40:35,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35" (1/1) ...
[2020-07-18 04:40:35,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35" (1/1) ...
[2020-07-18 04:40:35,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35" (1/1) ...
[2020-07-18 04:40:35,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35" (1/1) ...
[2020-07-18 04:40:35,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35" (1/1) ...
[2020-07-18 04:40:35,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-18 04:40:35,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-18 04:40:35,776 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-07-18 04:40:35,776 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-07-18 04:40:35,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35" (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-18 04:40:35,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-18 04:40:35,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-18 04:40:35,923 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd
[2020-07-18 04:40:35,923 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-07-18 04:40:35,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-18 04:40:35,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-18 04:40:35,923 INFO L130 BoogieDeclarations]: Found specification of procedure gcd
[2020-07-18 04:40:35,924 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-07-18 04:40:35,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-18 04:40:35,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-18 04:40:36,316 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-18 04:40:36,316 INFO L295 CfgBuilder]: Removed 0 assume(true) statements.
[2020-07-18 04:40:36,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:40:36 BoogieIcfgContainer
[2020-07-18 04:40:36,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-18 04:40:36,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-18 04:40:36,321 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-07-18 04:40:36,325 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-07-18 04:40:36,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 04:40:35" (1/3) ...
[2020-07-18 04:40:36,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcd3ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:40:36, skipping insertion in model container
[2020-07-18 04:40:36,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 04:40:35" (2/3) ...
[2020-07-18 04:40:36,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fcd3ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 04:40:36, skipping insertion in model container
[2020-07-18 04:40:36,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 04:40:36" (3/3) ...
[2020-07-18 04:40:36,329 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd01-1.c
[2020-07-18 04:40:36,339 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-07-18 04:40:36,346 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-18 04:40:36,360 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-18 04:40:36,381 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-07-18 04:40:36,381 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-07-18 04:40:36,381 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-07-18 04:40:36,381 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-18 04:40:36,381 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-18 04:40:36,382 INFO L380 AbstractCegarLoop]: Difference is false
[2020-07-18 04:40:36,382 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-18 04:40:36,382 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-18 04:40:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states.
[2020-07-18 04:40:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2020-07-18 04:40:36,410 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 04:40:36,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 04:40:36,411 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 04:40:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 04:40:36,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1470222128, now seen corresponding path program 1 times
[2020-07-18 04:40:36,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 04:40:36,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1685994796]
[2020-07-18 04:40:36,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 04:40:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:36,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} assume true; {46#true} is VALID
[2020-07-18 04:40:36,646 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {46#true} {46#true} #64#return; {46#true} is VALID
[2020-07-18 04:40:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:36,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} ~y1 := #in~y1; {58#(= gcd_~y1 |gcd_#in~y1|)} is VALID
[2020-07-18 04:40:36,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {59#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID
[2020-07-18 04:40:36,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {59#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:36,748 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:36,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:36,753 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {51#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} #68#return; {47#false} is VALID
[2020-07-18 04:40:36,754 INFO L263 TraceCheckUtils]: 0: Hoare triple {46#true} call ULTIMATE.init(); {46#true} is VALID
[2020-07-18 04:40:36,755 INFO L280 TraceCheckUtils]: 1: Hoare triple {46#true} assume true; {46#true} is VALID
[2020-07-18 04:40:36,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} #64#return; {46#true} is VALID
[2020-07-18 04:40:36,756 INFO L263 TraceCheckUtils]: 3: Hoare triple {46#true} call #t~ret5 := main(); {46#true} is VALID
[2020-07-18 04:40:36,756 INFO L280 TraceCheckUtils]: 4: Hoare triple {46#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {46#true} is VALID
[2020-07-18 04:40:36,757 INFO L280 TraceCheckUtils]: 5: Hoare triple {46#true} ~m~0 := #t~nondet2; {46#true} is VALID
[2020-07-18 04:40:36,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {46#true} havoc #t~nondet2; {46#true} is VALID
[2020-07-18 04:40:36,759 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {50#(<= 1 main_~m~0)} is VALID
[2020-07-18 04:40:36,761 INFO L280 TraceCheckUtils]: 8: Hoare triple {50#(<= 1 main_~m~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {50#(<= 1 main_~m~0)} is VALID
[2020-07-18 04:40:36,762 INFO L280 TraceCheckUtils]: 9: Hoare triple {50#(<= 1 main_~m~0)} ~n~0 := #t~nondet3; {50#(<= 1 main_~m~0)} is VALID
[2020-07-18 04:40:36,763 INFO L280 TraceCheckUtils]: 10: Hoare triple {50#(<= 1 main_~m~0)} havoc #t~nondet3; {50#(<= 1 main_~m~0)} is VALID
[2020-07-18 04:40:36,765 INFO L280 TraceCheckUtils]: 11: Hoare triple {50#(<= 1 main_~m~0)} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {51#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} is VALID
[2020-07-18 04:40:36,765 INFO L263 TraceCheckUtils]: 12: Hoare triple {51#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} call #t~ret4 := gcd(~m~0, ~n~0); {46#true} is VALID
[2020-07-18 04:40:36,766 INFO L280 TraceCheckUtils]: 13: Hoare triple {46#true} ~y1 := #in~y1; {58#(= gcd_~y1 |gcd_#in~y1|)} is VALID
[2020-07-18 04:40:36,767 INFO L280 TraceCheckUtils]: 14: Hoare triple {58#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {59#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID
[2020-07-18 04:40:36,769 INFO L280 TraceCheckUtils]: 15: Hoare triple {59#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:36,770 INFO L280 TraceCheckUtils]: 16: Hoare triple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:36,771 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:36,773 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {60#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {51#(and (<= 1 main_~m~0) (<= 1 main_~n~0))} #68#return; {47#false} is VALID
[2020-07-18 04:40:36,774 INFO L280 TraceCheckUtils]: 19: Hoare triple {47#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {47#false} is VALID
[2020-07-18 04:40:36,774 INFO L280 TraceCheckUtils]: 20: Hoare triple {47#false} ~z~0 := #t~ret4; {47#false} is VALID
[2020-07-18 04:40:36,775 INFO L280 TraceCheckUtils]: 21: Hoare triple {47#false} havoc #t~ret4; {47#false} is VALID
[2020-07-18 04:40:36,775 INFO L280 TraceCheckUtils]: 22: Hoare triple {47#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {47#false} is VALID
[2020-07-18 04:40:36,776 INFO L280 TraceCheckUtils]: 23: Hoare triple {47#false} assume !false; {47#false} is VALID
[2020-07-18 04:40:36,779 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-18 04:40:36,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1685994796]
[2020-07-18 04:40:36,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 04:40:36,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-07-18 04:40:36,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423206736]
[2020-07-18 04:40:36,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-07-18 04:40:36,795 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 04:40:36,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-18 04:40:36,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:36,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-18 04:40:36,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 04:40:36,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-18 04:40:36,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-07-18 04:40:36,862 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 7 states.
[2020-07-18 04:40:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:37,367 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions.
[2020-07-18 04:40:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-07-18 04:40:37,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24
[2020-07-18 04:40:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 04:40:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 04:40:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions.
[2020-07-18 04:40:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 04:40:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions.
[2020-07-18 04:40:37,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions.
[2020-07-18 04:40:37,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:37,502 INFO L225 Difference]: With dead ends: 60
[2020-07-18 04:40:37,502 INFO L226 Difference]: Without dead ends: 38
[2020-07-18 04:40:37,506 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2020-07-18 04:40:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states.
[2020-07-18 04:40:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38.
[2020-07-18 04:40:37,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 04:40:37,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states.
[2020-07-18 04:40:37,603 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states.
[2020-07-18 04:40:37,603 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states.
[2020-07-18 04:40:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:37,610 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions.
[2020-07-18 04:40:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions.
[2020-07-18 04:40:37,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:37,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:37,612 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states.
[2020-07-18 04:40:37,612 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states.
[2020-07-18 04:40:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:37,617 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions.
[2020-07-18 04:40:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions.
[2020-07-18 04:40:37,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:37,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:37,619 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 04:40:37,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 04:40:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2020-07-18 04:40:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions.
[2020-07-18 04:40:37,624 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 24
[2020-07-18 04:40:37,625 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 04:40:37,625 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions.
[2020-07-18 04:40:37,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-18 04:40:37,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 43 transitions.
[2020-07-18 04:40:37,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions.
[2020-07-18 04:40:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2020-07-18 04:40:37,691 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 04:40:37,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 04:40:37,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-18 04:40:37,692 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 04:40:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 04:40:37,692 INFO L82 PathProgramCache]: Analyzing trace with hash 831268307, now seen corresponding path program 1 times
[2020-07-18 04:40:37,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 04:40:37,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2063404733]
[2020-07-18 04:40:37,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 04:40:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:37,749 INFO L280 TraceCheckUtils]: 0: Hoare triple {337#true} assume true; {337#true} is VALID
[2020-07-18 04:40:37,750 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {337#true} {337#true} #64#return; {337#true} is VALID
[2020-07-18 04:40:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:37,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {337#true} ~y1 := #in~y1; {337#true} is VALID
[2020-07-18 04:40:37,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {337#true} ~y2 := #in~y2; {337#true} is VALID
[2020-07-18 04:40:37,788 INFO L280 TraceCheckUtils]: 2: Hoare triple {337#true} assume !(~y1 <= 0 || ~y2 <= 0); {350#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:37,789 INFO L280 TraceCheckUtils]: 3: Hoare triple {350#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {350#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:37,790 INFO L280 TraceCheckUtils]: 4: Hoare triple {350#(<= 1 gcd_~y1)} #res := ~y1; {351#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:37,791 INFO L280 TraceCheckUtils]: 5: Hoare triple {351#(<= 1 |gcd_#res|)} assume true; {351#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:37,792 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {351#(<= 1 |gcd_#res|)} {337#true} #68#return; {348#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:37,793 INFO L263 TraceCheckUtils]: 0: Hoare triple {337#true} call ULTIMATE.init(); {337#true} is VALID
[2020-07-18 04:40:37,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {337#true} assume true; {337#true} is VALID
[2020-07-18 04:40:37,793 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {337#true} {337#true} #64#return; {337#true} is VALID
[2020-07-18 04:40:37,794 INFO L263 TraceCheckUtils]: 3: Hoare triple {337#true} call #t~ret5 := main(); {337#true} is VALID
[2020-07-18 04:40:37,794 INFO L280 TraceCheckUtils]: 4: Hoare triple {337#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {337#true} is VALID
[2020-07-18 04:40:37,794 INFO L280 TraceCheckUtils]: 5: Hoare triple {337#true} ~m~0 := #t~nondet2; {337#true} is VALID
[2020-07-18 04:40:37,795 INFO L280 TraceCheckUtils]: 6: Hoare triple {337#true} havoc #t~nondet2; {337#true} is VALID
[2020-07-18 04:40:37,795 INFO L280 TraceCheckUtils]: 7: Hoare triple {337#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {337#true} is VALID
[2020-07-18 04:40:37,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {337#true} is VALID
[2020-07-18 04:40:37,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {337#true} ~n~0 := #t~nondet3; {337#true} is VALID
[2020-07-18 04:40:37,796 INFO L280 TraceCheckUtils]: 10: Hoare triple {337#true} havoc #t~nondet3; {337#true} is VALID
[2020-07-18 04:40:37,796 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {337#true} is VALID
[2020-07-18 04:40:37,797 INFO L263 TraceCheckUtils]: 12: Hoare triple {337#true} call #t~ret4 := gcd(~m~0, ~n~0); {337#true} is VALID
[2020-07-18 04:40:37,797 INFO L280 TraceCheckUtils]: 13: Hoare triple {337#true} ~y1 := #in~y1; {337#true} is VALID
[2020-07-18 04:40:37,797 INFO L280 TraceCheckUtils]: 14: Hoare triple {337#true} ~y2 := #in~y2; {337#true} is VALID
[2020-07-18 04:40:37,798 INFO L280 TraceCheckUtils]: 15: Hoare triple {337#true} assume !(~y1 <= 0 || ~y2 <= 0); {350#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:37,799 INFO L280 TraceCheckUtils]: 16: Hoare triple {350#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {350#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:37,800 INFO L280 TraceCheckUtils]: 17: Hoare triple {350#(<= 1 gcd_~y1)} #res := ~y1; {351#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:37,801 INFO L280 TraceCheckUtils]: 18: Hoare triple {351#(<= 1 |gcd_#res|)} assume true; {351#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:37,802 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {351#(<= 1 |gcd_#res|)} {337#true} #68#return; {348#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:37,803 INFO L280 TraceCheckUtils]: 20: Hoare triple {348#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {348#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:37,804 INFO L280 TraceCheckUtils]: 21: Hoare triple {348#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {349#(<= 1 main_~z~0)} is VALID
[2020-07-18 04:40:37,805 INFO L280 TraceCheckUtils]: 22: Hoare triple {349#(<= 1 main_~z~0)} havoc #t~ret4; {349#(<= 1 main_~z~0)} is VALID
[2020-07-18 04:40:37,805 INFO L280 TraceCheckUtils]: 23: Hoare triple {349#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {338#false} is VALID
[2020-07-18 04:40:37,806 INFO L280 TraceCheckUtils]: 24: Hoare triple {338#false} assume !false; {338#false} is VALID
[2020-07-18 04:40:37,807 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-18 04:40:37,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2063404733]
[2020-07-18 04:40:37,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 04:40:37,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-07-18 04:40:37,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783055585]
[2020-07-18 04:40:37,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25
[2020-07-18 04:40:37,810 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 04:40:37,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states.
[2020-07-18 04:40:37,839 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-18 04:40:37,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-07-18 04:40:37,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 04:40:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-07-18 04:40:37,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-07-18 04:40:37,841 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 6 states.
[2020-07-18 04:40:38,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:38,185 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions.
[2020-07-18 04:40:38,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-07-18 04:40:38,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25
[2020-07-18 04:40:38,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 04:40:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-07-18 04:40:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions.
[2020-07-18 04:40:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-07-18 04:40:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions.
[2020-07-18 04:40:38,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 52 transitions.
[2020-07-18 04:40:38,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:38,259 INFO L225 Difference]: With dead ends: 46
[2020-07-18 04:40:38,260 INFO L226 Difference]: Without dead ends: 40
[2020-07-18 04:40:38,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-07-18 04:40:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2020-07-18 04:40:38,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38.
[2020-07-18 04:40:38,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 04:40:38,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 38 states.
[2020-07-18 04:40:38,323 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 38 states.
[2020-07-18 04:40:38,323 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 38 states.
[2020-07-18 04:40:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:38,327 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions.
[2020-07-18 04:40:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions.
[2020-07-18 04:40:38,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:38,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:38,329 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 40 states.
[2020-07-18 04:40:38,329 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 40 states.
[2020-07-18 04:40:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:38,333 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions.
[2020-07-18 04:40:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions.
[2020-07-18 04:40:38,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:38,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:38,334 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 04:40:38,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 04:40:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2020-07-18 04:40:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions.
[2020-07-18 04:40:38,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25
[2020-07-18 04:40:38,338 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 04:40:38,338 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions.
[2020-07-18 04:40:38,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-07-18 04:40:38,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 43 transitions.
[2020-07-18 04:40:38,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions.
[2020-07-18 04:40:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2020-07-18 04:40:38,398 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 04:40:38,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 04:40:38,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-18 04:40:38,399 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 04:40:38,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 04:40:38,399 INFO L82 PathProgramCache]: Analyzing trace with hash -852904039, now seen corresponding path program 1 times
[2020-07-18 04:40:38,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 04:40:38,400 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1935639363]
[2020-07-18 04:40:38,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 04:40:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:38,455 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} assume true; {606#true} is VALID
[2020-07-18 04:40:38,456 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {606#true} {606#true} #64#return; {606#true} is VALID
[2020-07-18 04:40:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:38,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} ~y1 := #in~y1; {636#(= gcd_~y1 |gcd_#in~y1|)} is VALID
[2020-07-18 04:40:38,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {636#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID
[2020-07-18 04:40:38,602 INFO L280 TraceCheckUtils]: 2: Hoare triple {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:38,602 INFO L280 TraceCheckUtils]: 3: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:38,603 INFO L280 TraceCheckUtils]: 4: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:38,605 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #62#return; {607#false} is VALID
[2020-07-18 04:40:38,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {606#true} ~y1 := #in~y1; {606#true} is VALID
[2020-07-18 04:40:38,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} ~y2 := #in~y2; {606#true} is VALID
[2020-07-18 04:40:38,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {606#true} assume !(~y1 <= 0 || ~y2 <= 0); {627#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:38,607 INFO L280 TraceCheckUtils]: 3: Hoare triple {627#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {628#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} is VALID
[2020-07-18 04:40:38,608 INFO L280 TraceCheckUtils]: 4: Hoare triple {628#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} assume !(~y1 > ~y2); {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} is VALID
[2020-07-18 04:40:38,609 INFO L263 TraceCheckUtils]: 5: Hoare triple {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {606#true} is VALID
[2020-07-18 04:40:38,609 INFO L280 TraceCheckUtils]: 6: Hoare triple {606#true} ~y1 := #in~y1; {636#(= gcd_~y1 |gcd_#in~y1|)} is VALID
[2020-07-18 04:40:38,610 INFO L280 TraceCheckUtils]: 7: Hoare triple {636#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID
[2020-07-18 04:40:38,611 INFO L280 TraceCheckUtils]: 8: Hoare triple {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:38,611 INFO L280 TraceCheckUtils]: 9: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:38,612 INFO L280 TraceCheckUtils]: 10: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:38,614 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #62#return; {607#false} is VALID
[2020-07-18 04:40:38,614 INFO L280 TraceCheckUtils]: 12: Hoare triple {607#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {607#false} is VALID
[2020-07-18 04:40:38,615 INFO L280 TraceCheckUtils]: 13: Hoare triple {607#false} #res := #t~ret1; {607#false} is VALID
[2020-07-18 04:40:38,615 INFO L280 TraceCheckUtils]: 14: Hoare triple {607#false} havoc #t~ret1; {607#false} is VALID
[2020-07-18 04:40:38,615 INFO L280 TraceCheckUtils]: 15: Hoare triple {607#false} assume true; {607#false} is VALID
[2020-07-18 04:40:38,616 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {607#false} {606#true} #68#return; {607#false} is VALID
[2020-07-18 04:40:38,617 INFO L263 TraceCheckUtils]: 0: Hoare triple {606#true} call ULTIMATE.init(); {606#true} is VALID
[2020-07-18 04:40:38,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {606#true} assume true; {606#true} is VALID
[2020-07-18 04:40:38,617 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {606#true} {606#true} #64#return; {606#true} is VALID
[2020-07-18 04:40:38,618 INFO L263 TraceCheckUtils]: 3: Hoare triple {606#true} call #t~ret5 := main(); {606#true} is VALID
[2020-07-18 04:40:38,618 INFO L280 TraceCheckUtils]: 4: Hoare triple {606#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {606#true} is VALID
[2020-07-18 04:40:38,618 INFO L280 TraceCheckUtils]: 5: Hoare triple {606#true} ~m~0 := #t~nondet2; {606#true} is VALID
[2020-07-18 04:40:38,619 INFO L280 TraceCheckUtils]: 6: Hoare triple {606#true} havoc #t~nondet2; {606#true} is VALID
[2020-07-18 04:40:38,619 INFO L280 TraceCheckUtils]: 7: Hoare triple {606#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {606#true} is VALID
[2020-07-18 04:40:38,619 INFO L280 TraceCheckUtils]: 8: Hoare triple {606#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {606#true} is VALID
[2020-07-18 04:40:38,619 INFO L280 TraceCheckUtils]: 9: Hoare triple {606#true} ~n~0 := #t~nondet3; {606#true} is VALID
[2020-07-18 04:40:38,620 INFO L280 TraceCheckUtils]: 10: Hoare triple {606#true} havoc #t~nondet3; {606#true} is VALID
[2020-07-18 04:40:38,620 INFO L280 TraceCheckUtils]: 11: Hoare triple {606#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {606#true} is VALID
[2020-07-18 04:40:38,620 INFO L263 TraceCheckUtils]: 12: Hoare triple {606#true} call #t~ret4 := gcd(~m~0, ~n~0); {606#true} is VALID
[2020-07-18 04:40:38,620 INFO L280 TraceCheckUtils]: 13: Hoare triple {606#true} ~y1 := #in~y1; {606#true} is VALID
[2020-07-18 04:40:38,621 INFO L280 TraceCheckUtils]: 14: Hoare triple {606#true} ~y2 := #in~y2; {606#true} is VALID
[2020-07-18 04:40:38,622 INFO L280 TraceCheckUtils]: 15: Hoare triple {606#true} assume !(~y1 <= 0 || ~y2 <= 0); {627#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:38,624 INFO L280 TraceCheckUtils]: 16: Hoare triple {627#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {628#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} is VALID
[2020-07-18 04:40:38,625 INFO L280 TraceCheckUtils]: 17: Hoare triple {628#(and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1))} assume !(~y1 > ~y2); {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} is VALID
[2020-07-18 04:40:38,626 INFO L263 TraceCheckUtils]: 18: Hoare triple {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {606#true} is VALID
[2020-07-18 04:40:38,626 INFO L280 TraceCheckUtils]: 19: Hoare triple {606#true} ~y1 := #in~y1; {636#(= gcd_~y1 |gcd_#in~y1|)} is VALID
[2020-07-18 04:40:38,627 INFO L280 TraceCheckUtils]: 20: Hoare triple {636#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID
[2020-07-18 04:40:38,628 INFO L280 TraceCheckUtils]: 21: Hoare triple {637#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:38,628 INFO L280 TraceCheckUtils]: 22: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:38,629 INFO L280 TraceCheckUtils]: 23: Hoare triple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:38,631 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {638#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {629#(and (<= 1 gcd_~y1) (< gcd_~y1 gcd_~y2))} #62#return; {607#false} is VALID
[2020-07-18 04:40:38,631 INFO L280 TraceCheckUtils]: 25: Hoare triple {607#false} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {607#false} is VALID
[2020-07-18 04:40:38,631 INFO L280 TraceCheckUtils]: 26: Hoare triple {607#false} #res := #t~ret1; {607#false} is VALID
[2020-07-18 04:40:38,631 INFO L280 TraceCheckUtils]: 27: Hoare triple {607#false} havoc #t~ret1; {607#false} is VALID
[2020-07-18 04:40:38,632 INFO L280 TraceCheckUtils]: 28: Hoare triple {607#false} assume true; {607#false} is VALID
[2020-07-18 04:40:38,632 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {607#false} {606#true} #68#return; {607#false} is VALID
[2020-07-18 04:40:38,632 INFO L280 TraceCheckUtils]: 30: Hoare triple {607#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {607#false} is VALID
[2020-07-18 04:40:38,633 INFO L280 TraceCheckUtils]: 31: Hoare triple {607#false} ~z~0 := #t~ret4; {607#false} is VALID
[2020-07-18 04:40:38,633 INFO L280 TraceCheckUtils]: 32: Hoare triple {607#false} havoc #t~ret4; {607#false} is VALID
[2020-07-18 04:40:38,633 INFO L280 TraceCheckUtils]: 33: Hoare triple {607#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {607#false} is VALID
[2020-07-18 04:40:38,633 INFO L280 TraceCheckUtils]: 34: Hoare triple {607#false} assume !false; {607#false} is VALID
[2020-07-18 04:40:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2020-07-18 04:40:38,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1935639363]
[2020-07-18 04:40:38,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 04:40:38,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-07-18 04:40:38,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620270736]
[2020-07-18 04:40:38,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35
[2020-07-18 04:40:38,637 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 04:40:38,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states.
[2020-07-18 04:40:38,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:38,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-07-18 04:40:38,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 04:40:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-07-18 04:40:38,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2020-07-18 04:40:38,675 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 8 states.
[2020-07-18 04:40:39,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:39,202 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions.
[2020-07-18 04:40:39,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2020-07-18 04:40:39,203 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35
[2020-07-18 04:40:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 04:40:39,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-18 04:40:39,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions.
[2020-07-18 04:40:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-18 04:40:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions.
[2020-07-18 04:40:39,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 65 transitions.
[2020-07-18 04:40:39,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:39,307 INFO L225 Difference]: With dead ends: 56
[2020-07-18 04:40:39,307 INFO L226 Difference]: Without dead ends: 42
[2020-07-18 04:40:39,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132
[2020-07-18 04:40:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2020-07-18 04:40:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40.
[2020-07-18 04:40:39,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 04:40:39,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states.
[2020-07-18 04:40:39,383 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states.
[2020-07-18 04:40:39,383 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states.
[2020-07-18 04:40:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:39,386 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions.
[2020-07-18 04:40:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions.
[2020-07-18 04:40:39,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:39,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:39,388 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states.
[2020-07-18 04:40:39,388 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states.
[2020-07-18 04:40:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:39,392 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions.
[2020-07-18 04:40:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions.
[2020-07-18 04:40:39,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:39,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:39,396 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 04:40:39,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 04:40:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2020-07-18 04:40:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions.
[2020-07-18 04:40:39,402 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 35
[2020-07-18 04:40:39,403 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 04:40:39,403 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions.
[2020-07-18 04:40:39,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-07-18 04:40:39,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 45 transitions.
[2020-07-18 04:40:39,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions.
[2020-07-18 04:40:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2020-07-18 04:40:39,483 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 04:40:39,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 04:40:39,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-18 04:40:39,484 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 04:40:39,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 04:40:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2030561919, now seen corresponding path program 1 times
[2020-07-18 04:40:39,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 04:40:39,485 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1219253733]
[2020-07-18 04:40:39,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 04:40:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:39,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#true} assume true; {925#true} is VALID
[2020-07-18 04:40:39,523 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {925#true} {925#true} #64#return; {925#true} is VALID
[2020-07-18 04:40:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:39,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#true} ~y1 := #in~y1; {954#(= gcd_~y1 |gcd_#in~y1|)} is VALID
[2020-07-18 04:40:39,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID
[2020-07-18 04:40:39,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:39,601 INFO L280 TraceCheckUtils]: 3: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:39,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:39,604 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #60#return; {926#false} is VALID
[2020-07-18 04:40:39,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {925#true} ~y1 := #in~y1; {925#true} is VALID
[2020-07-18 04:40:39,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {925#true} ~y2 := #in~y2; {925#true} is VALID
[2020-07-18 04:40:39,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {925#true} assume !(~y1 <= 0 || ~y2 <= 0); {946#(<= 1 gcd_~y2)} is VALID
[2020-07-18 04:40:39,606 INFO L280 TraceCheckUtils]: 3: Hoare triple {946#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {946#(<= 1 gcd_~y2)} is VALID
[2020-07-18 04:40:39,607 INFO L280 TraceCheckUtils]: 4: Hoare triple {946#(<= 1 gcd_~y2)} assume ~y1 > ~y2; {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} is VALID
[2020-07-18 04:40:39,607 INFO L263 TraceCheckUtils]: 5: Hoare triple {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {925#true} is VALID
[2020-07-18 04:40:39,607 INFO L280 TraceCheckUtils]: 6: Hoare triple {925#true} ~y1 := #in~y1; {954#(= gcd_~y1 |gcd_#in~y1|)} is VALID
[2020-07-18 04:40:39,608 INFO L280 TraceCheckUtils]: 7: Hoare triple {954#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID
[2020-07-18 04:40:39,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:39,610 INFO L280 TraceCheckUtils]: 9: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:39,610 INFO L280 TraceCheckUtils]: 10: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:39,612 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #60#return; {926#false} is VALID
[2020-07-18 04:40:39,612 INFO L280 TraceCheckUtils]: 12: Hoare triple {926#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {926#false} is VALID
[2020-07-18 04:40:39,612 INFO L280 TraceCheckUtils]: 13: Hoare triple {926#false} #res := #t~ret0; {926#false} is VALID
[2020-07-18 04:40:39,613 INFO L280 TraceCheckUtils]: 14: Hoare triple {926#false} havoc #t~ret0; {926#false} is VALID
[2020-07-18 04:40:39,613 INFO L280 TraceCheckUtils]: 15: Hoare triple {926#false} assume true; {926#false} is VALID
[2020-07-18 04:40:39,613 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {926#false} {925#true} #68#return; {926#false} is VALID
[2020-07-18 04:40:39,614 INFO L263 TraceCheckUtils]: 0: Hoare triple {925#true} call ULTIMATE.init(); {925#true} is VALID
[2020-07-18 04:40:39,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {925#true} assume true; {925#true} is VALID
[2020-07-18 04:40:39,614 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {925#true} {925#true} #64#return; {925#true} is VALID
[2020-07-18 04:40:39,615 INFO L263 TraceCheckUtils]: 3: Hoare triple {925#true} call #t~ret5 := main(); {925#true} is VALID
[2020-07-18 04:40:39,615 INFO L280 TraceCheckUtils]: 4: Hoare triple {925#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {925#true} is VALID
[2020-07-18 04:40:39,615 INFO L280 TraceCheckUtils]: 5: Hoare triple {925#true} ~m~0 := #t~nondet2; {925#true} is VALID
[2020-07-18 04:40:39,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {925#true} havoc #t~nondet2; {925#true} is VALID
[2020-07-18 04:40:39,616 INFO L280 TraceCheckUtils]: 7: Hoare triple {925#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {925#true} is VALID
[2020-07-18 04:40:39,616 INFO L280 TraceCheckUtils]: 8: Hoare triple {925#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {925#true} is VALID
[2020-07-18 04:40:39,616 INFO L280 TraceCheckUtils]: 9: Hoare triple {925#true} ~n~0 := #t~nondet3; {925#true} is VALID
[2020-07-18 04:40:39,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {925#true} havoc #t~nondet3; {925#true} is VALID
[2020-07-18 04:40:39,617 INFO L280 TraceCheckUtils]: 11: Hoare triple {925#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {925#true} is VALID
[2020-07-18 04:40:39,617 INFO L263 TraceCheckUtils]: 12: Hoare triple {925#true} call #t~ret4 := gcd(~m~0, ~n~0); {925#true} is VALID
[2020-07-18 04:40:39,617 INFO L280 TraceCheckUtils]: 13: Hoare triple {925#true} ~y1 := #in~y1; {925#true} is VALID
[2020-07-18 04:40:39,617 INFO L280 TraceCheckUtils]: 14: Hoare triple {925#true} ~y2 := #in~y2; {925#true} is VALID
[2020-07-18 04:40:39,618 INFO L280 TraceCheckUtils]: 15: Hoare triple {925#true} assume !(~y1 <= 0 || ~y2 <= 0); {946#(<= 1 gcd_~y2)} is VALID
[2020-07-18 04:40:39,619 INFO L280 TraceCheckUtils]: 16: Hoare triple {946#(<= 1 gcd_~y2)} assume !(~y1 == ~y2); {946#(<= 1 gcd_~y2)} is VALID
[2020-07-18 04:40:39,620 INFO L280 TraceCheckUtils]: 17: Hoare triple {946#(<= 1 gcd_~y2)} assume ~y1 > ~y2; {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} is VALID
[2020-07-18 04:40:39,620 INFO L263 TraceCheckUtils]: 18: Hoare triple {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {925#true} is VALID
[2020-07-18 04:40:39,621 INFO L280 TraceCheckUtils]: 19: Hoare triple {925#true} ~y1 := #in~y1; {954#(= gcd_~y1 |gcd_#in~y1|)} is VALID
[2020-07-18 04:40:39,621 INFO L280 TraceCheckUtils]: 20: Hoare triple {954#(= gcd_~y1 |gcd_#in~y1|)} ~y2 := #in~y2; {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} is VALID
[2020-07-18 04:40:39,622 INFO L280 TraceCheckUtils]: 21: Hoare triple {955#(and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))} assume ~y1 <= 0 || ~y2 <= 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:39,622 INFO L280 TraceCheckUtils]: 22: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} #res := 0; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:39,623 INFO L280 TraceCheckUtils]: 23: Hoare triple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} assume true; {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} is VALID
[2020-07-18 04:40:39,624 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {956#(or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))} {947#(and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2))} #60#return; {926#false} is VALID
[2020-07-18 04:40:39,625 INFO L280 TraceCheckUtils]: 25: Hoare triple {926#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {926#false} is VALID
[2020-07-18 04:40:39,625 INFO L280 TraceCheckUtils]: 26: Hoare triple {926#false} #res := #t~ret0; {926#false} is VALID
[2020-07-18 04:40:39,625 INFO L280 TraceCheckUtils]: 27: Hoare triple {926#false} havoc #t~ret0; {926#false} is VALID
[2020-07-18 04:40:39,625 INFO L280 TraceCheckUtils]: 28: Hoare triple {926#false} assume true; {926#false} is VALID
[2020-07-18 04:40:39,626 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {926#false} {925#true} #68#return; {926#false} is VALID
[2020-07-18 04:40:39,626 INFO L280 TraceCheckUtils]: 30: Hoare triple {926#false} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {926#false} is VALID
[2020-07-18 04:40:39,626 INFO L280 TraceCheckUtils]: 31: Hoare triple {926#false} ~z~0 := #t~ret4; {926#false} is VALID
[2020-07-18 04:40:39,626 INFO L280 TraceCheckUtils]: 32: Hoare triple {926#false} havoc #t~ret4; {926#false} is VALID
[2020-07-18 04:40:39,627 INFO L280 TraceCheckUtils]: 33: Hoare triple {926#false} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {926#false} is VALID
[2020-07-18 04:40:39,627 INFO L280 TraceCheckUtils]: 34: Hoare triple {926#false} assume !false; {926#false} is VALID
[2020-07-18 04:40:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2020-07-18 04:40:39,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1219253733]
[2020-07-18 04:40:39,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 04:40:39,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-07-18 04:40:39,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592833129]
[2020-07-18 04:40:39,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35
[2020-07-18 04:40:39,630 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 04:40:39,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-18 04:40:39,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:39,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-18 04:40:39,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 04:40:39,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-18 04:40:39,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-07-18 04:40:39,665 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states.
[2020-07-18 04:40:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:40,036 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions.
[2020-07-18 04:40:40,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-07-18 04:40:40,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35
[2020-07-18 04:40:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 04:40:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 04:40:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions.
[2020-07-18 04:40:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 04:40:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions.
[2020-07-18 04:40:40,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions.
[2020-07-18 04:40:40,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:40,107 INFO L225 Difference]: With dead ends: 56
[2020-07-18 04:40:40,107 INFO L226 Difference]: Without dead ends: 39
[2020-07-18 04:40:40,108 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2020-07-18 04:40:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2020-07-18 04:40:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37.
[2020-07-18 04:40:40,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 04:40:40,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states.
[2020-07-18 04:40:40,171 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states.
[2020-07-18 04:40:40,171 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states.
[2020-07-18 04:40:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:40,175 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions.
[2020-07-18 04:40:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions.
[2020-07-18 04:40:40,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:40,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:40,176 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states.
[2020-07-18 04:40:40,176 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states.
[2020-07-18 04:40:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:40,178 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions.
[2020-07-18 04:40:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions.
[2020-07-18 04:40:40,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:40,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:40,179 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 04:40:40,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 04:40:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states.
[2020-07-18 04:40:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions.
[2020-07-18 04:40:40,182 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 35
[2020-07-18 04:40:40,182 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 04:40:40,182 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions.
[2020-07-18 04:40:40,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-18 04:40:40,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 41 transitions.
[2020-07-18 04:40:40,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions.
[2020-07-18 04:40:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2020-07-18 04:40:40,236 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 04:40:40,237 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 04:40:40,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-07-18 04:40:40,237 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 04:40:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 04:40:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2122258312, now seen corresponding path program 1 times
[2020-07-18 04:40:40,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 04:40:40,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [88744041]
[2020-07-18 04:40:40,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 04:40:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:40,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} assume true; {1229#true} is VALID
[2020-07-18 04:40:40,292 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1229#true} {1229#true} #64#return; {1229#true} is VALID
[2020-07-18 04:40:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:40,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID
[2020-07-18 04:40:40,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID
[2020-07-18 04:40:40,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {1253#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {1253#(<= 1 gcd_~y1)} #res := ~y1; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,349 INFO L280 TraceCheckUtils]: 5: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,350 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1253#(<= 1 gcd_~y1)} #62#return; {1261#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:40,350 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID
[2020-07-18 04:40:40,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID
[2020-07-18 04:40:40,351 INFO L280 TraceCheckUtils]: 2: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,352 INFO L280 TraceCheckUtils]: 3: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,353 INFO L280 TraceCheckUtils]: 4: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,353 INFO L263 TraceCheckUtils]: 5: Hoare triple {1253#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1229#true} is VALID
[2020-07-18 04:40:40,353 INFO L280 TraceCheckUtils]: 6: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID
[2020-07-18 04:40:40,354 INFO L280 TraceCheckUtils]: 7: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID
[2020-07-18 04:40:40,354 INFO L280 TraceCheckUtils]: 8: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,355 INFO L280 TraceCheckUtils]: 9: Hoare triple {1253#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,356 INFO L280 TraceCheckUtils]: 10: Hoare triple {1253#(<= 1 gcd_~y1)} #res := ~y1; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,356 INFO L280 TraceCheckUtils]: 11: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,358 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1253#(<= 1 gcd_~y1)} #62#return; {1261#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:40,358 INFO L280 TraceCheckUtils]: 13: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1261#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:40,359 INFO L280 TraceCheckUtils]: 14: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,359 INFO L280 TraceCheckUtils]: 15: Hoare triple {1262#(<= 1 |gcd_#res|)} havoc #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,360 INFO L280 TraceCheckUtils]: 16: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,361 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1229#true} #68#return; {1251#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:40,362 INFO L263 TraceCheckUtils]: 0: Hoare triple {1229#true} call ULTIMATE.init(); {1229#true} is VALID
[2020-07-18 04:40:40,362 INFO L280 TraceCheckUtils]: 1: Hoare triple {1229#true} assume true; {1229#true} is VALID
[2020-07-18 04:40:40,362 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1229#true} {1229#true} #64#return; {1229#true} is VALID
[2020-07-18 04:40:40,362 INFO L263 TraceCheckUtils]: 3: Hoare triple {1229#true} call #t~ret5 := main(); {1229#true} is VALID
[2020-07-18 04:40:40,363 INFO L280 TraceCheckUtils]: 4: Hoare triple {1229#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1229#true} is VALID
[2020-07-18 04:40:40,363 INFO L280 TraceCheckUtils]: 5: Hoare triple {1229#true} ~m~0 := #t~nondet2; {1229#true} is VALID
[2020-07-18 04:40:40,363 INFO L280 TraceCheckUtils]: 6: Hoare triple {1229#true} havoc #t~nondet2; {1229#true} is VALID
[2020-07-18 04:40:40,363 INFO L280 TraceCheckUtils]: 7: Hoare triple {1229#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {1229#true} is VALID
[2020-07-18 04:40:40,364 INFO L280 TraceCheckUtils]: 8: Hoare triple {1229#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1229#true} is VALID
[2020-07-18 04:40:40,364 INFO L280 TraceCheckUtils]: 9: Hoare triple {1229#true} ~n~0 := #t~nondet3; {1229#true} is VALID
[2020-07-18 04:40:40,364 INFO L280 TraceCheckUtils]: 10: Hoare triple {1229#true} havoc #t~nondet3; {1229#true} is VALID
[2020-07-18 04:40:40,364 INFO L280 TraceCheckUtils]: 11: Hoare triple {1229#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {1229#true} is VALID
[2020-07-18 04:40:40,364 INFO L263 TraceCheckUtils]: 12: Hoare triple {1229#true} call #t~ret4 := gcd(~m~0, ~n~0); {1229#true} is VALID
[2020-07-18 04:40:40,365 INFO L280 TraceCheckUtils]: 13: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID
[2020-07-18 04:40:40,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID
[2020-07-18 04:40:40,366 INFO L280 TraceCheckUtils]: 15: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,367 INFO L280 TraceCheckUtils]: 17: Hoare triple {1253#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,367 INFO L263 TraceCheckUtils]: 18: Hoare triple {1253#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1229#true} is VALID
[2020-07-18 04:40:40,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {1229#true} ~y1 := #in~y1; {1229#true} is VALID
[2020-07-18 04:40:40,368 INFO L280 TraceCheckUtils]: 20: Hoare triple {1229#true} ~y2 := #in~y2; {1229#true} is VALID
[2020-07-18 04:40:40,368 INFO L280 TraceCheckUtils]: 21: Hoare triple {1229#true} assume !(~y1 <= 0 || ~y2 <= 0); {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,369 INFO L280 TraceCheckUtils]: 22: Hoare triple {1253#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1253#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:40,370 INFO L280 TraceCheckUtils]: 23: Hoare triple {1253#(<= 1 gcd_~y1)} #res := ~y1; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,370 INFO L280 TraceCheckUtils]: 24: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,371 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1253#(<= 1 gcd_~y1)} #62#return; {1261#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:40,372 INFO L280 TraceCheckUtils]: 26: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1261#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:40,372 INFO L280 TraceCheckUtils]: 27: Hoare triple {1261#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,373 INFO L280 TraceCheckUtils]: 28: Hoare triple {1262#(<= 1 |gcd_#res|)} havoc #t~ret1; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,373 INFO L280 TraceCheckUtils]: 29: Hoare triple {1262#(<= 1 |gcd_#res|)} assume true; {1262#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:40,374 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1262#(<= 1 |gcd_#res|)} {1229#true} #68#return; {1251#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:40,374 INFO L280 TraceCheckUtils]: 31: Hoare triple {1251#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1251#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:40,375 INFO L280 TraceCheckUtils]: 32: Hoare triple {1251#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {1252#(<= 1 main_~z~0)} is VALID
[2020-07-18 04:40:40,375 INFO L280 TraceCheckUtils]: 33: Hoare triple {1252#(<= 1 main_~z~0)} havoc #t~ret4; {1252#(<= 1 main_~z~0)} is VALID
[2020-07-18 04:40:40,376 INFO L280 TraceCheckUtils]: 34: Hoare triple {1252#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {1230#false} is VALID
[2020-07-18 04:40:40,376 INFO L280 TraceCheckUtils]: 35: Hoare triple {1230#false} assume !false; {1230#false} is VALID
[2020-07-18 04:40:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-07-18 04:40:40,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [88744041]
[2020-07-18 04:40:40,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 04:40:40,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-07-18 04:40:40,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908852082]
[2020-07-18 04:40:40,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36
[2020-07-18 04:40:40,382 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 04:40:40,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-18 04:40:40,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:40,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-18 04:40:40,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 04:40:40,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-18 04:40:40,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2020-07-18 04:40:40,421 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states.
[2020-07-18 04:40:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:40,823 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions.
[2020-07-18 04:40:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2020-07-18 04:40:40,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36
[2020-07-18 04:40:40,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 04:40:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 04:40:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions.
[2020-07-18 04:40:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 04:40:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions.
[2020-07-18 04:40:40,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions.
[2020-07-18 04:40:40,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:40,887 INFO L225 Difference]: With dead ends: 48
[2020-07-18 04:40:40,887 INFO L226 Difference]: Without dead ends: 42
[2020-07-18 04:40:40,887 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2020-07-18 04:40:40,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2020-07-18 04:40:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40.
[2020-07-18 04:40:40,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 04:40:40,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states.
[2020-07-18 04:40:40,969 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states.
[2020-07-18 04:40:40,969 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states.
[2020-07-18 04:40:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:40,972 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions.
[2020-07-18 04:40:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions.
[2020-07-18 04:40:40,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:40,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:40,973 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states.
[2020-07-18 04:40:40,973 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states.
[2020-07-18 04:40:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:40,976 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions.
[2020-07-18 04:40:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions.
[2020-07-18 04:40:40,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:40,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:40,977 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 04:40:40,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 04:40:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2020-07-18 04:40:40,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions.
[2020-07-18 04:40:40,979 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 36
[2020-07-18 04:40:40,980 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 04:40:40,980 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions.
[2020-07-18 04:40:40,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-18 04:40:40,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 44 transitions.
[2020-07-18 04:40:41,045 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-18 04:40:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions.
[2020-07-18 04:40:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2020-07-18 04:40:41,047 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 04:40:41,047 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 04:40:41,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-07-18 04:40:41,048 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 04:40:41,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 04:40:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash 404002040, now seen corresponding path program 1 times
[2020-07-18 04:40:41,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 04:40:41,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1120838303]
[2020-07-18 04:40:41,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 04:40:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:41,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} assume true; {1533#true} is VALID
[2020-07-18 04:40:41,098 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1533#true} {1533#true} #64#return; {1533#true} is VALID
[2020-07-18 04:40:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:41,149 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID
[2020-07-18 04:40:41,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID
[2020-07-18 04:40:41,151 INFO L280 TraceCheckUtils]: 2: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1566#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,151 INFO L280 TraceCheckUtils]: 3: Hoare triple {1566#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1566#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {1566#(<= 1 gcd_~y1)} #res := ~y1; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,153 INFO L280 TraceCheckUtils]: 5: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,154 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #60#return; {1564#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:41,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID
[2020-07-18 04:40:41,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID
[2020-07-18 04:40:41,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1533#true} is VALID
[2020-07-18 04:40:41,155 INFO L280 TraceCheckUtils]: 3: Hoare triple {1533#true} assume !(~y1 == ~y2); {1533#true} is VALID
[2020-07-18 04:40:41,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {1533#true} assume ~y1 > ~y2; {1533#true} is VALID
[2020-07-18 04:40:41,156 INFO L263 TraceCheckUtils]: 5: Hoare triple {1533#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1533#true} is VALID
[2020-07-18 04:40:41,156 INFO L280 TraceCheckUtils]: 6: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID
[2020-07-18 04:40:41,156 INFO L280 TraceCheckUtils]: 7: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID
[2020-07-18 04:40:41,157 INFO L280 TraceCheckUtils]: 8: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1566#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,158 INFO L280 TraceCheckUtils]: 9: Hoare triple {1566#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1566#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,158 INFO L280 TraceCheckUtils]: 10: Hoare triple {1566#(<= 1 gcd_~y1)} #res := ~y1; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,159 INFO L280 TraceCheckUtils]: 11: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,161 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #60#return; {1564#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:41,161 INFO L280 TraceCheckUtils]: 13: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1564#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:41,162 INFO L280 TraceCheckUtils]: 14: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,163 INFO L280 TraceCheckUtils]: 15: Hoare triple {1565#(<= 1 |gcd_#res|)} havoc #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,163 INFO L280 TraceCheckUtils]: 16: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,165 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #68#return; {1555#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:41,165 INFO L263 TraceCheckUtils]: 0: Hoare triple {1533#true} call ULTIMATE.init(); {1533#true} is VALID
[2020-07-18 04:40:41,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {1533#true} assume true; {1533#true} is VALID
[2020-07-18 04:40:41,165 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1533#true} {1533#true} #64#return; {1533#true} is VALID
[2020-07-18 04:40:41,166 INFO L263 TraceCheckUtils]: 3: Hoare triple {1533#true} call #t~ret5 := main(); {1533#true} is VALID
[2020-07-18 04:40:41,166 INFO L280 TraceCheckUtils]: 4: Hoare triple {1533#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1533#true} is VALID
[2020-07-18 04:40:41,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {1533#true} ~m~0 := #t~nondet2; {1533#true} is VALID
[2020-07-18 04:40:41,166 INFO L280 TraceCheckUtils]: 6: Hoare triple {1533#true} havoc #t~nondet2; {1533#true} is VALID
[2020-07-18 04:40:41,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {1533#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {1533#true} is VALID
[2020-07-18 04:40:41,167 INFO L280 TraceCheckUtils]: 8: Hoare triple {1533#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1533#true} is VALID
[2020-07-18 04:40:41,167 INFO L280 TraceCheckUtils]: 9: Hoare triple {1533#true} ~n~0 := #t~nondet3; {1533#true} is VALID
[2020-07-18 04:40:41,167 INFO L280 TraceCheckUtils]: 10: Hoare triple {1533#true} havoc #t~nondet3; {1533#true} is VALID
[2020-07-18 04:40:41,168 INFO L280 TraceCheckUtils]: 11: Hoare triple {1533#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {1533#true} is VALID
[2020-07-18 04:40:41,168 INFO L263 TraceCheckUtils]: 12: Hoare triple {1533#true} call #t~ret4 := gcd(~m~0, ~n~0); {1533#true} is VALID
[2020-07-18 04:40:41,168 INFO L280 TraceCheckUtils]: 13: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID
[2020-07-18 04:40:41,168 INFO L280 TraceCheckUtils]: 14: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID
[2020-07-18 04:40:41,169 INFO L280 TraceCheckUtils]: 15: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1533#true} is VALID
[2020-07-18 04:40:41,169 INFO L280 TraceCheckUtils]: 16: Hoare triple {1533#true} assume !(~y1 == ~y2); {1533#true} is VALID
[2020-07-18 04:40:41,169 INFO L280 TraceCheckUtils]: 17: Hoare triple {1533#true} assume ~y1 > ~y2; {1533#true} is VALID
[2020-07-18 04:40:41,170 INFO L263 TraceCheckUtils]: 18: Hoare triple {1533#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1533#true} is VALID
[2020-07-18 04:40:41,170 INFO L280 TraceCheckUtils]: 19: Hoare triple {1533#true} ~y1 := #in~y1; {1533#true} is VALID
[2020-07-18 04:40:41,170 INFO L280 TraceCheckUtils]: 20: Hoare triple {1533#true} ~y2 := #in~y2; {1533#true} is VALID
[2020-07-18 04:40:41,171 INFO L280 TraceCheckUtils]: 21: Hoare triple {1533#true} assume !(~y1 <= 0 || ~y2 <= 0); {1566#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,171 INFO L280 TraceCheckUtils]: 22: Hoare triple {1566#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1566#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,172 INFO L280 TraceCheckUtils]: 23: Hoare triple {1566#(<= 1 gcd_~y1)} #res := ~y1; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,173 INFO L280 TraceCheckUtils]: 24: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,174 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #60#return; {1564#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:41,174 INFO L280 TraceCheckUtils]: 26: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1564#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:41,175 INFO L280 TraceCheckUtils]: 27: Hoare triple {1564#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,175 INFO L280 TraceCheckUtils]: 28: Hoare triple {1565#(<= 1 |gcd_#res|)} havoc #t~ret0; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,176 INFO L280 TraceCheckUtils]: 29: Hoare triple {1565#(<= 1 |gcd_#res|)} assume true; {1565#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,177 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1565#(<= 1 |gcd_#res|)} {1533#true} #68#return; {1555#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:41,178 INFO L280 TraceCheckUtils]: 31: Hoare triple {1555#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1555#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:41,178 INFO L280 TraceCheckUtils]: 32: Hoare triple {1555#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {1556#(<= 1 main_~z~0)} is VALID
[2020-07-18 04:40:41,179 INFO L280 TraceCheckUtils]: 33: Hoare triple {1556#(<= 1 main_~z~0)} havoc #t~ret4; {1556#(<= 1 main_~z~0)} is VALID
[2020-07-18 04:40:41,180 INFO L280 TraceCheckUtils]: 34: Hoare triple {1556#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {1534#false} is VALID
[2020-07-18 04:40:41,180 INFO L280 TraceCheckUtils]: 35: Hoare triple {1534#false} assume !false; {1534#false} is VALID
[2020-07-18 04:40:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2020-07-18 04:40:41,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1120838303]
[2020-07-18 04:40:41,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 04:40:41,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2020-07-18 04:40:41,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77328111]
[2020-07-18 04:40:41,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36
[2020-07-18 04:40:41,183 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 04:40:41,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-18 04:40:41,214 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-18 04:40:41,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-18 04:40:41,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 04:40:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-18 04:40:41,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2020-07-18 04:40:41,215 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states.
[2020-07-18 04:40:41,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:41,577 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions.
[2020-07-18 04:40:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2020-07-18 04:40:41,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36
[2020-07-18 04:40:41,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 04:40:41,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 04:40:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions.
[2020-07-18 04:40:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-18 04:40:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions.
[2020-07-18 04:40:41,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 50 transitions.
[2020-07-18 04:40:41,633 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:41,635 INFO L225 Difference]: With dead ends: 53
[2020-07-18 04:40:41,635 INFO L226 Difference]: Without dead ends: 47
[2020-07-18 04:40:41,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2020-07-18 04:40:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2020-07-18 04:40:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2020-07-18 04:40:41,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 04:40:41,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states.
[2020-07-18 04:40:41,759 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states.
[2020-07-18 04:40:41,759 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states.
[2020-07-18 04:40:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:41,762 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions.
[2020-07-18 04:40:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions.
[2020-07-18 04:40:41,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:41,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:41,763 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states.
[2020-07-18 04:40:41,764 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states.
[2020-07-18 04:40:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:41,767 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions.
[2020-07-18 04:40:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions.
[2020-07-18 04:40:41,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:41,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:41,768 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 04:40:41,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 04:40:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2020-07-18 04:40:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions.
[2020-07-18 04:40:41,770 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 36
[2020-07-18 04:40:41,771 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 04:40:41,771 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions.
[2020-07-18 04:40:41,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-18 04:40:41,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 53 transitions.
[2020-07-18 04:40:41,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions.
[2020-07-18 04:40:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2020-07-18 04:40:41,850 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-18 04:40:41,850 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-18 04:40:41,850 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-07-18 04:40:41,851 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-18 04:40:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-18 04:40:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1010225367, now seen corresponding path program 1 times
[2020-07-18 04:40:41,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-18 04:40:41,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345354890]
[2020-07-18 04:40:41,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-18 04:40:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:41,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} assume true; {1871#true} is VALID
[2020-07-18 04:40:41,898 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1871#true} {1871#true} #64#return; {1871#true} is VALID
[2020-07-18 04:40:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-18 04:40:41,992 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID
[2020-07-18 04:40:41,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID
[2020-07-18 04:40:41,993 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,994 INFO L280 TraceCheckUtils]: 4: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,995 INFO L280 TraceCheckUtils]: 5: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:41,997 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1926#(<= 1 gcd_~y1)} #62#return; {1934#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:41,997 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID
[2020-07-18 04:40:41,998 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID
[2020-07-18 04:40:41,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,999 INFO L280 TraceCheckUtils]: 3: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:41,999 INFO L280 TraceCheckUtils]: 4: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,000 INFO L263 TraceCheckUtils]: 5: Hoare triple {1926#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1871#true} is VALID
[2020-07-18 04:40:42,000 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID
[2020-07-18 04:40:42,000 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID
[2020-07-18 04:40:42,001 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,001 INFO L280 TraceCheckUtils]: 9: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,002 INFO L280 TraceCheckUtils]: 10: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,002 INFO L280 TraceCheckUtils]: 11: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,004 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1926#(<= 1 gcd_~y1)} #62#return; {1934#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:42,006 INFO L280 TraceCheckUtils]: 13: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1934#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:42,008 INFO L280 TraceCheckUtils]: 14: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,010 INFO L280 TraceCheckUtils]: 15: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,011 INFO L280 TraceCheckUtils]: 16: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,014 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #60#return; {1924#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:42,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID
[2020-07-18 04:40:42,015 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID
[2020-07-18 04:40:42,015 INFO L280 TraceCheckUtils]: 2: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1871#true} is VALID
[2020-07-18 04:40:42,016 INFO L280 TraceCheckUtils]: 3: Hoare triple {1871#true} assume !(~y1 == ~y2); {1871#true} is VALID
[2020-07-18 04:40:42,016 INFO L280 TraceCheckUtils]: 4: Hoare triple {1871#true} assume ~y1 > ~y2; {1871#true} is VALID
[2020-07-18 04:40:42,016 INFO L263 TraceCheckUtils]: 5: Hoare triple {1871#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1871#true} is VALID
[2020-07-18 04:40:42,016 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID
[2020-07-18 04:40:42,016 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID
[2020-07-18 04:40:42,018 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,019 INFO L280 TraceCheckUtils]: 9: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,020 INFO L280 TraceCheckUtils]: 10: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,021 INFO L263 TraceCheckUtils]: 11: Hoare triple {1926#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1871#true} is VALID
[2020-07-18 04:40:42,021 INFO L280 TraceCheckUtils]: 12: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID
[2020-07-18 04:40:42,021 INFO L280 TraceCheckUtils]: 13: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID
[2020-07-18 04:40:42,022 INFO L280 TraceCheckUtils]: 14: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,023 INFO L280 TraceCheckUtils]: 15: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,024 INFO L280 TraceCheckUtils]: 16: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,024 INFO L280 TraceCheckUtils]: 17: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,026 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1926#(<= 1 gcd_~y1)} #62#return; {1934#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:42,026 INFO L280 TraceCheckUtils]: 19: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1934#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:42,027 INFO L280 TraceCheckUtils]: 20: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,027 INFO L280 TraceCheckUtils]: 21: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,027 INFO L280 TraceCheckUtils]: 22: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,028 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #60#return; {1924#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:42,029 INFO L280 TraceCheckUtils]: 24: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1924#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:42,029 INFO L280 TraceCheckUtils]: 25: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,029 INFO L280 TraceCheckUtils]: 26: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,030 INFO L280 TraceCheckUtils]: 27: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,031 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #68#return; {1904#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:42,032 INFO L263 TraceCheckUtils]: 0: Hoare triple {1871#true} call ULTIMATE.init(); {1871#true} is VALID
[2020-07-18 04:40:42,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {1871#true} assume true; {1871#true} is VALID
[2020-07-18 04:40:42,032 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1871#true} {1871#true} #64#return; {1871#true} is VALID
[2020-07-18 04:40:42,032 INFO L263 TraceCheckUtils]: 3: Hoare triple {1871#true} call #t~ret5 := main(); {1871#true} is VALID
[2020-07-18 04:40:42,032 INFO L280 TraceCheckUtils]: 4: Hoare triple {1871#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1871#true} is VALID
[2020-07-18 04:40:42,033 INFO L280 TraceCheckUtils]: 5: Hoare triple {1871#true} ~m~0 := #t~nondet2; {1871#true} is VALID
[2020-07-18 04:40:42,033 INFO L280 TraceCheckUtils]: 6: Hoare triple {1871#true} havoc #t~nondet2; {1871#true} is VALID
[2020-07-18 04:40:42,033 INFO L280 TraceCheckUtils]: 7: Hoare triple {1871#true} assume !(~m~0 <= 0 || ~m~0 > 2147483647); {1871#true} is VALID
[2020-07-18 04:40:42,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {1871#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1871#true} is VALID
[2020-07-18 04:40:42,034 INFO L280 TraceCheckUtils]: 9: Hoare triple {1871#true} ~n~0 := #t~nondet3; {1871#true} is VALID
[2020-07-18 04:40:42,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {1871#true} havoc #t~nondet3; {1871#true} is VALID
[2020-07-18 04:40:42,034 INFO L280 TraceCheckUtils]: 11: Hoare triple {1871#true} assume !(~n~0 <= 0 || ~n~0 > 2147483647); {1871#true} is VALID
[2020-07-18 04:40:42,034 INFO L263 TraceCheckUtils]: 12: Hoare triple {1871#true} call #t~ret4 := gcd(~m~0, ~n~0); {1871#true} is VALID
[2020-07-18 04:40:42,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID
[2020-07-18 04:40:42,035 INFO L280 TraceCheckUtils]: 14: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID
[2020-07-18 04:40:42,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1871#true} is VALID
[2020-07-18 04:40:42,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {1871#true} assume !(~y1 == ~y2); {1871#true} is VALID
[2020-07-18 04:40:42,035 INFO L280 TraceCheckUtils]: 17: Hoare triple {1871#true} assume ~y1 > ~y2; {1871#true} is VALID
[2020-07-18 04:40:42,035 INFO L263 TraceCheckUtils]: 18: Hoare triple {1871#true} call #t~ret0 := gcd(~y1 - ~y2, ~y2); {1871#true} is VALID
[2020-07-18 04:40:42,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID
[2020-07-18 04:40:42,036 INFO L280 TraceCheckUtils]: 20: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID
[2020-07-18 04:40:42,038 INFO L280 TraceCheckUtils]: 21: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,039 INFO L280 TraceCheckUtils]: 22: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 == ~y2); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,041 INFO L280 TraceCheckUtils]: 23: Hoare triple {1926#(<= 1 gcd_~y1)} assume !(~y1 > ~y2); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,042 INFO L263 TraceCheckUtils]: 24: Hoare triple {1926#(<= 1 gcd_~y1)} call #t~ret1 := gcd(~y1, ~y2 - ~y1); {1871#true} is VALID
[2020-07-18 04:40:42,042 INFO L280 TraceCheckUtils]: 25: Hoare triple {1871#true} ~y1 := #in~y1; {1871#true} is VALID
[2020-07-18 04:40:42,042 INFO L280 TraceCheckUtils]: 26: Hoare triple {1871#true} ~y2 := #in~y2; {1871#true} is VALID
[2020-07-18 04:40:42,043 INFO L280 TraceCheckUtils]: 27: Hoare triple {1871#true} assume !(~y1 <= 0 || ~y2 <= 0); {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,045 INFO L280 TraceCheckUtils]: 28: Hoare triple {1926#(<= 1 gcd_~y1)} assume ~y1 == ~y2; {1926#(<= 1 gcd_~y1)} is VALID
[2020-07-18 04:40:42,046 INFO L280 TraceCheckUtils]: 29: Hoare triple {1926#(<= 1 gcd_~y1)} #res := ~y1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,047 INFO L280 TraceCheckUtils]: 30: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,048 INFO L275 TraceCheckUtils]: 31: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1926#(<= 1 gcd_~y1)} #62#return; {1934#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:42,048 INFO L280 TraceCheckUtils]: 32: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; {1934#(<= 1 |gcd_#t~ret1|)} is VALID
[2020-07-18 04:40:42,049 INFO L280 TraceCheckUtils]: 33: Hoare triple {1934#(<= 1 |gcd_#t~ret1|)} #res := #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,050 INFO L280 TraceCheckUtils]: 34: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret1; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,050 INFO L280 TraceCheckUtils]: 35: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,051 INFO L275 TraceCheckUtils]: 36: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #60#return; {1924#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:42,052 INFO L280 TraceCheckUtils]: 37: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; {1924#(<= 1 |gcd_#t~ret0|)} is VALID
[2020-07-18 04:40:42,052 INFO L280 TraceCheckUtils]: 38: Hoare triple {1924#(<= 1 |gcd_#t~ret0|)} #res := #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,053 INFO L280 TraceCheckUtils]: 39: Hoare triple {1925#(<= 1 |gcd_#res|)} havoc #t~ret0; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,054 INFO L280 TraceCheckUtils]: 40: Hoare triple {1925#(<= 1 |gcd_#res|)} assume true; {1925#(<= 1 |gcd_#res|)} is VALID
[2020-07-18 04:40:42,055 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {1925#(<= 1 |gcd_#res|)} {1871#true} #68#return; {1904#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:42,055 INFO L280 TraceCheckUtils]: 42: Hoare triple {1904#(<= 1 |main_#t~ret4|)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; {1904#(<= 1 |main_#t~ret4|)} is VALID
[2020-07-18 04:40:42,056 INFO L280 TraceCheckUtils]: 43: Hoare triple {1904#(<= 1 |main_#t~ret4|)} ~z~0 := #t~ret4; {1905#(<= 1 main_~z~0)} is VALID
[2020-07-18 04:40:42,057 INFO L280 TraceCheckUtils]: 44: Hoare triple {1905#(<= 1 main_~z~0)} havoc #t~ret4; {1905#(<= 1 main_~z~0)} is VALID
[2020-07-18 04:40:42,057 INFO L280 TraceCheckUtils]: 45: Hoare triple {1905#(<= 1 main_~z~0)} assume (~z~0 < 1 && ~m~0 > 0) && ~n~0 > 0; {1872#false} is VALID
[2020-07-18 04:40:42,057 INFO L280 TraceCheckUtils]: 46: Hoare triple {1872#false} assume !false; {1872#false} is VALID
[2020-07-18 04:40:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2020-07-18 04:40:42,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345354890]
[2020-07-18 04:40:42,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-18 04:40:42,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2020-07-18 04:40:42,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40810427]
[2020-07-18 04:40:42,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47
[2020-07-18 04:40:42,061 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-18 04:40:42,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states.
[2020-07-18 04:40:42,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:42,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-07-18 04:40:42,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-18 04:40:42,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-07-18 04:40:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2020-07-18 04:40:42,103 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 8 states.
[2020-07-18 04:40:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:42,499 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions.
[2020-07-18 04:40:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2020-07-18 04:40:42,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47
[2020-07-18 04:40:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-18 04:40:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-18 04:40:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions.
[2020-07-18 04:40:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-18 04:40:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions.
[2020-07-18 04:40:42,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions.
[2020-07-18 04:40:42,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:42,548 INFO L225 Difference]: With dead ends: 47
[2020-07-18 04:40:42,548 INFO L226 Difference]: Without dead ends: 0
[2020-07-18 04:40:42,550 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182
[2020-07-18 04:40:42,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2020-07-18 04:40:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2020-07-18 04:40:42,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-18 04:40:42,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states.
[2020-07-18 04:40:42,550 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-18 04:40:42,550 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-18 04:40:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:42,551 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-18 04:40:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-18 04:40:42,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:42,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:42,553 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-18 04:40:42,553 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-18 04:40:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-18 04:40:42,553 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-18 04:40:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-18 04:40:42,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:42,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-18 04:40:42,554 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-18 04:40:42,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-18 04:40:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2020-07-18 04:40:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2020-07-18 04:40:42,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47
[2020-07-18 04:40:42,554 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-18 04:40:42,555 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2020-07-18 04:40:42,555 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-07-18 04:40:42,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2020-07-18 04:40:42,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-18 04:40:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-18 04:40:42,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-18 04:40:42,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-07-18 04:40:42,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2020-07-18 04:40:43,299 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2020-07-18 04:40:43,299 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true
[2020-07-18 04:40:43,300 INFO L264 CegarLoopResult]: At program point gcdFINAL(lines 15 26) the Hoare annotation is: (let ((.cse0 (= gcd_~y1 |gcd_#in~y1|)) (.cse1 (= gcd_~y2 |gcd_#in~y2|))) (or (and .cse0 .cse1 (or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))) (and .cse0 .cse1 (<= 1 |gcd_#res|))))
[2020-07-18 04:40:43,300 INFO L264 CegarLoopResult]: At program point gcdEXIT(lines 15 26) the Hoare annotation is: (let ((.cse0 (= gcd_~y1 |gcd_#in~y1|)) (.cse1 (= gcd_~y2 |gcd_#in~y2|))) (or (and .cse0 .cse1 (or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0))) (and .cse0 .cse1 (<= 1 |gcd_#res|))))
[2020-07-18 04:40:43,300 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-18 04:40:43,300 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 |gcd_#t~ret1|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2))
[2020-07-18 04:40:43,300 INFO L271 CegarLoopResult]: At program point gcdENTRY(lines 15 26) the Hoare annotation is: true
[2020-07-18 04:40:43,300 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-18 04:40:43,301 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 |gcd_#t~ret1|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (< gcd_~y1 gcd_~y2))
[2020-07-18 04:40:43,301 INFO L264 CegarLoopResult]: At program point L22(lines 22 24) the Hoare annotation is: (and (not (= gcd_~y1 gcd_~y2)) (<= 1 gcd_~y1) (<= 1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))
[2020-07-18 04:40:43,301 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2) (<= 1 |gcd_#t~ret0|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))
[2020-07-18 04:40:43,301 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 |gcd_#t~ret1|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (<= 1 |gcd_#res|) (< gcd_~y1 gcd_~y2))
[2020-07-18 04:40:43,301 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2) (<= 1 |gcd_#t~ret0|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))
[2020-07-18 04:40:43,301 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))
[2020-07-18 04:40:43,302 INFO L264 CegarLoopResult]: At program point L23-3(line 23) the Hoare annotation is: (and (<= (+ gcd_~y2 1) gcd_~y1) (<= 1 gcd_~y2) (<= 1 |gcd_#t~ret0|) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (<= 1 |gcd_#res|))
[2020-07-18 04:40:43,302 INFO L264 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: (and (<= 1 gcd_~y1) (<= 1 gcd_~y2) (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))
[2020-07-18 04:40:43,302 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|) (or (<= |gcd_#in~y2| 0) (<= |gcd_#in~y1| 0)))
[2020-07-18 04:40:43,302 INFO L264 CegarLoopResult]: At program point L16(lines 16 18) the Hoare annotation is: (and (= gcd_~y1 |gcd_#in~y1|) (= gcd_~y2 |gcd_#in~y2|))
[2020-07-18 04:40:43,302 INFO L264 CegarLoopResult]: At program point L15(lines 15 26) the Hoare annotation is: (= gcd_~y1 |gcd_#in~y1|)
[2020-07-18 04:40:43,302 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true
[2020-07-18 04:40:43,302 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true
[2020-07-18 04:40:43,302 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2020-07-18 04:40:43,303 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true
[2020-07-18 04:40:43,303 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (<= 1 main_~m~0)
[2020-07-18 04:40:43,303 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (<= 1 main_~m~0)
[2020-07-18 04:40:43,303 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true
[2020-07-18 04:40:43,303 INFO L264 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: (<= 1 main_~m~0)
[2020-07-18 04:40:43,303 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true
[2020-07-18 04:40:43,303 INFO L271 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true
[2020-07-18 04:40:43,303 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 28 43) the Hoare annotation is: true
[2020-07-18 04:40:43,304 INFO L264 CegarLoopResult]: At program point L38(lines 38 42) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~z~0) (<= 1 main_~n~0))
[2020-07-18 04:40:43,304 INFO L271 CegarLoopResult]: At program point L38-1(lines 28 43) the Hoare annotation is: true
[2020-07-18 04:40:43,304 INFO L264 CegarLoopResult]: At program point L34(lines 34 36) the Hoare annotation is: (<= 1 main_~m~0)
[2020-07-18 04:40:43,304 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) the Hoare annotation is: false
[2020-07-18 04:40:43,304 INFO L271 CegarLoopResult]: At program point L30(lines 30 32) the Hoare annotation is: true
[2020-07-18 04:40:43,304 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 28 43) the Hoare annotation is: true
[2020-07-18 04:40:43,304 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0))
[2020-07-18 04:40:43,305 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: false
[2020-07-18 04:40:43,305 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 1 main_~m~0) (<= 1 main_~n~0))
[2020-07-18 04:40:43,305 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= 1 main_~m~0) (<= 1 main_~n~0))
[2020-07-18 04:40:43,305 INFO L264 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (<= 1 main_~m~0)
[2020-07-18 04:40:43,305 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= 1 main_~m~0) (<= 1 main_~n~0))
[2020-07-18 04:40:43,305 INFO L264 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (and (<= 1 |main_#t~ret4|) (<= 1 main_~m~0) (<= 1 main_~z~0) (<= 1 main_~n~0))
[2020-07-18 04:40:43,329 INFO L163 areAnnotationChecker]: CFG has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-18 04:40:43,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 04:40:43 BoogieIcfgContainer
[2020-07-18 04:40:43,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-18 04:40:43,345 INFO L168 Benchmark]: Toolchain (without parser) took 7850.08 ms. Allocated memory was 136.8 MB in the beginning and 312.5 MB in the end (delta: 175.6 MB). Free memory was 101.9 MB in the beginning and 209.7 MB in the end (delta: -107.8 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB.
[2020-07-18 04:40:43,346 INFO L168 Benchmark]: CDTParser took 0.90 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
[2020-07-18 04:40:43,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.80 ms. Allocated memory is still 136.8 MB. Free memory was 101.5 MB in the beginning and 91.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB.
[2020-07-18 04:40:43,347 INFO L168 Benchmark]: Boogie Preprocessor took 28.61 ms. Allocated memory is still 136.8 MB. Free memory was 91.8 MB in the beginning and 90.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB.
[2020-07-18 04:40:43,348 INFO L168 Benchmark]: RCFGBuilder took 544.47 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.4 MB in the beginning and 156.9 MB in the end (delta: -66.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB.
[2020-07-18 04:40:43,348 INFO L168 Benchmark]: TraceAbstraction took 7020.70 ms. Allocated memory was 200.8 MB in the beginning and 312.5 MB in the end (delta: 111.7 MB). Free memory was 156.9 MB in the beginning and 209.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB.
[2020-07-18 04:40:43,352 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.90 ms. Allocated memory is still 136.8 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 249.80 ms. Allocated memory is still 136.8 MB. Free memory was 101.5 MB in the beginning and 91.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 28.61 ms. Allocated memory is still 136.8 MB. Free memory was 91.8 MB in the beginning and 90.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 544.47 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 90.4 MB in the beginning and 156.9 MB in the end (delta: -66.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 7020.70 ms. Allocated memory was 200.8 MB in the beginning and 312.5 MB in the end (delta: 111.7 MB). Free memory was 156.9 MB in the beginning and 209.7 MB in the end (delta: -52.8 MB). Peak memory consumption was 58.8 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
- ProcedureContractResult [Line: 15]: Procedure Contract for gcd
Derived contract for procedure gcd: ((y1 == \old(y1) && y2 == \old(y2)) && (\old(y2) <= 0 || \old(y1) <= 0)) || ((y1 == \old(y1) && y2 == \old(y2)) && 1 <= \result)
- ProcedureContractResult [Line: 28]: Procedure Contract for main
Derived contract for procedure main: 1
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.1s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 227 SDtfs, 215 SDslu, 754 SDs, 0 SdLazy, 352 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred 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.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 77 PreInvPairs, 139 NumberOfFragments, 341 HoareAnnotationTreeSize, 77 FomulaSimplifications, 1448 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 43 FomulaSimplificationsInter, 410 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 15935 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 41/41 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...