/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/bitvector/gcd_4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:42:35,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:42:35,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:42:35,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:42:35,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:42:35,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:42:35,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:42:35,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:42:35,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:42:36,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:42:36,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:42:36,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:42:36,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:42:36,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:42:36,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:42:36,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:42:36,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:42:36,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:42:36,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:42:36,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:42:36,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:42:36,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:42:36,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:42:36,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:42:36,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:42:36,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:42:36,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:42:36,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:42:36,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:42:36,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:42:36,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:42:36,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:42:36,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:42:36,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:42:36,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:42:36,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:42:36,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:42:36,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:42:36,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:42:36,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:42:36,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:42:36,051 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:42:36,089 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:42:36,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:42:36,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:42:36,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:42:36,094 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:42:36,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:42:36,095 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:42:36,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:42:36,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:42:36,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:42:36,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:42:36,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:42:36,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:42:36,096 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:42:36,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:42:36,096 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:42:36,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:42:36,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:42:36,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:42:36,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:42:36,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:42:36,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:42:36,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:42:36,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:42:36,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:42:36,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:42:36,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:42:36,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:42:36,099 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:42:36,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:42:36,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:42:36,385 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:42:36,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:42:36,391 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:42:36,391 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:42:36,392 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/gcd_4.c [2020-07-10 14:42:36,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fba5b723/c51e1c53e936496a95552f21f9c79d7f/FLAGcc51ac242 [2020-07-10 14:42:36,914 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:42:36,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_4.c [2020-07-10 14:42:36,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fba5b723/c51e1c53e936496a95552f21f9c79d7f/FLAGcc51ac242 [2020-07-10 14:42:37,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fba5b723/c51e1c53e936496a95552f21f9c79d7f [2020-07-10 14:42:37,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:42:37,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:42:37,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:37,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:42:37,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:42:37,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:37" (1/1) ... [2020-07-10 14:42:37,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfc5529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37, skipping insertion in model container [2020-07-10 14:42:37,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:42:37" (1/1) ... [2020-07-10 14:42:37,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:42:37,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:42:37,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:37,512 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:42:37,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:42:37,546 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:42:37,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37 WrapperNode [2020-07-10 14:42:37,547 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:42:37,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:42:37,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:42:37,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:42:37,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37" (1/1) ... [2020-07-10 14:42:37,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37" (1/1) ... [2020-07-10 14:42:37,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37" (1/1) ... [2020-07-10 14:42:37,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37" (1/1) ... [2020-07-10 14:42:37,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37" (1/1) ... [2020-07-10 14:42:37,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37" (1/1) ... [2020-07-10 14:42:37,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37" (1/1) ... [2020-07-10 14:42:37,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:42:37,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:42:37,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:42:37,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:42:37,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37" (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-10 14:42:37,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:42:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:42:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 14:42:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd_test [2020-07-10 14:42:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:42:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:42:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:42:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 14:42:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure gcd_test [2020-07-10 14:42:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:42:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:42:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:42:38,098 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:42:38,098 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 14:42:38,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:38 BoogieIcfgContainer [2020-07-10 14:42:38,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:42:38,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:42:38,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:42:38,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:42:38,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:42:37" (1/3) ... [2020-07-10 14:42:38,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39faecd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:38, skipping insertion in model container [2020-07-10 14:42:38,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:42:37" (2/3) ... [2020-07-10 14:42:38,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39faecd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:42:38, skipping insertion in model container [2020-07-10 14:42:38,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:42:38" (3/3) ... [2020-07-10 14:42:38,111 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd_4.c [2020-07-10 14:42:38,120 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:42:38,127 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:42:38,138 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:42:38,162 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:42:38,163 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:42:38,163 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:42:38,163 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:42:38,163 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:42:38,163 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:42:38,163 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:42:38,163 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:42:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-10 14:42:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 14:42:38,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:38,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:38,189 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:38,196 INFO L82 PathProgramCache]: Analyzing trace with hash 876608673, now seen corresponding path program 1 times [2020-07-10 14:42:38,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:38,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972915969] [2020-07-10 14:42:38,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:38,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-10 14:42:38,410 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #61#return; {33#true} is VALID [2020-07-10 14:42:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:38,448 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~a := #in~a;~b := #in~b; {33#true} is VALID [2020-07-10 14:42:38,450 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume ~a < 0;~a := -~a; {44#(<= 1 gcd_test_~a)} is VALID [2020-07-10 14:42:38,451 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#(<= 1 gcd_test_~a)} assume ~b < 0;~b := -~b; {44#(<= 1 gcd_test_~a)} is VALID [2020-07-10 14:42:38,453 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(<= 1 gcd_test_~a)} assume 0 == ~a;#res := ~b; {34#false} is VALID [2020-07-10 14:42:38,453 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#false} assume true; {34#false} is VALID [2020-07-10 14:42:38,454 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {34#false} {37#(<= 63 main_~x~0)} #65#return; {34#false} is VALID [2020-07-10 14:42:38,455 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-10 14:42:38,455 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-10 14:42:38,456 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #61#return; {33#true} is VALID [2020-07-10 14:42:38,456 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret1 := main(); {33#true} is VALID [2020-07-10 14:42:38,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {37#(<= 63 main_~x~0)} is VALID [2020-07-10 14:42:38,458 INFO L263 TraceCheckUtils]: 5: Hoare triple {37#(<= 63 main_~x~0)} call #t~ret0 := gcd_test(~x~0, ~y~0); {33#true} is VALID [2020-07-10 14:42:38,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} ~a := #in~a;~b := #in~b; {33#true} is VALID [2020-07-10 14:42:38,461 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#true} assume ~a < 0;~a := -~a; {44#(<= 1 gcd_test_~a)} is VALID [2020-07-10 14:42:38,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#(<= 1 gcd_test_~a)} assume ~b < 0;~b := -~b; {44#(<= 1 gcd_test_~a)} is VALID [2020-07-10 14:42:38,465 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#(<= 1 gcd_test_~a)} assume 0 == ~a;#res := ~b; {34#false} is VALID [2020-07-10 14:42:38,465 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#false} assume true; {34#false} is VALID [2020-07-10 14:42:38,466 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {34#false} {37#(<= 63 main_~x~0)} #65#return; {34#false} is VALID [2020-07-10 14:42:38,466 INFO L280 TraceCheckUtils]: 12: Hoare triple {34#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {34#false} is VALID [2020-07-10 14:42:38,467 INFO L263 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {34#false} is VALID [2020-07-10 14:42:38,467 INFO L280 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2020-07-10 14:42:38,468 INFO L280 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2020-07-10 14:42:38,468 INFO L280 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-10 14:42:38,470 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-10 14:42:38,471 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972915969] [2020-07-10 14:42:38,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:38,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 14:42:38,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351094223] [2020-07-10 14:42:38,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 14:42:38,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:38,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 14:42:38,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:38,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 14:42:38,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:38,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 14:42:38,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:42:38,547 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2020-07-10 14:42:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:38,865 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2020-07-10 14:42:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 14:42:38,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-10 14:42:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-10 14:42:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 14:42:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-10 14:42:38,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2020-07-10 14:42:39,016 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:39,030 INFO L225 Difference]: With dead ends: 55 [2020-07-10 14:42:39,030 INFO L226 Difference]: Without dead ends: 32 [2020-07-10 14:42:39,035 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 14:42:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-10 14:42:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2020-07-10 14:42:39,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:39,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2020-07-10 14:42:39,092 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2020-07-10 14:42:39,092 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2020-07-10 14:42:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:39,099 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-07-10 14:42:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2020-07-10 14:42:39,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:39,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:39,101 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2020-07-10 14:42:39,101 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2020-07-10 14:42:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:39,107 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-07-10 14:42:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2020-07-10 14:42:39,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:39,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:39,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:39,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 14:42:39,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-07-10 14:42:39,115 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 17 [2020-07-10 14:42:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:39,115 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-10 14:42:39,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 14:42:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-10 14:42:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 14:42:39,117 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:39,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:39,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:42:39,118 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:39,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:39,119 INFO L82 PathProgramCache]: Analyzing trace with hash 483581663, now seen corresponding path program 1 times [2020-07-10 14:42:39,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:39,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372456678] [2020-07-10 14:42:39,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:39,147 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 14:42:39,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [769746519] [2020-07-10 14:42:39,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:39,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 14:42:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:39,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:42:39,323 INFO L263 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2020-07-10 14:42:39,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2020-07-10 14:42:39,324 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #61#return; {220#true} is VALID [2020-07-10 14:42:39,324 INFO L263 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret1 := main(); {220#true} is VALID [2020-07-10 14:42:39,325 INFO L280 TraceCheckUtils]: 4: Hoare triple {220#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {237#(<= 63 main_~x~0)} is VALID [2020-07-10 14:42:39,326 INFO L263 TraceCheckUtils]: 5: Hoare triple {237#(<= 63 main_~x~0)} call #t~ret0 := gcd_test(~x~0, ~y~0); {220#true} is VALID [2020-07-10 14:42:39,326 INFO L280 TraceCheckUtils]: 6: Hoare triple {220#true} ~a := #in~a;~b := #in~b; {244#(<= |gcd_test_#in~a| gcd_test_~a)} is VALID [2020-07-10 14:42:39,327 INFO L280 TraceCheckUtils]: 7: Hoare triple {244#(<= |gcd_test_#in~a| gcd_test_~a)} assume !(~a < 0); {244#(<= |gcd_test_#in~a| gcd_test_~a)} is VALID [2020-07-10 14:42:39,328 INFO L280 TraceCheckUtils]: 8: Hoare triple {244#(<= |gcd_test_#in~a| gcd_test_~a)} assume ~b < 0;~b := -~b; {244#(<= |gcd_test_#in~a| gcd_test_~a)} is VALID [2020-07-10 14:42:39,329 INFO L280 TraceCheckUtils]: 9: Hoare triple {244#(<= |gcd_test_#in~a| gcd_test_~a)} assume 0 == ~a;#res := ~b; {254#(<= |gcd_test_#in~a| 0)} is VALID [2020-07-10 14:42:39,330 INFO L280 TraceCheckUtils]: 10: Hoare triple {254#(<= |gcd_test_#in~a| 0)} assume true; {254#(<= |gcd_test_#in~a| 0)} is VALID [2020-07-10 14:42:39,332 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {254#(<= |gcd_test_#in~a| 0)} {237#(<= 63 main_~x~0)} #65#return; {221#false} is VALID [2020-07-10 14:42:39,333 INFO L280 TraceCheckUtils]: 12: Hoare triple {221#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {221#false} is VALID [2020-07-10 14:42:39,333 INFO L263 TraceCheckUtils]: 13: Hoare triple {221#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {221#false} is VALID [2020-07-10 14:42:39,333 INFO L280 TraceCheckUtils]: 14: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2020-07-10 14:42:39,334 INFO L280 TraceCheckUtils]: 15: Hoare triple {221#false} assume 0 == ~cond; {221#false} is VALID [2020-07-10 14:42:39,334 INFO L280 TraceCheckUtils]: 16: Hoare triple {221#false} assume !false; {221#false} is VALID [2020-07-10 14:42:39,335 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-10 14:42:39,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372456678] [2020-07-10 14:42:39,336 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 14:42:39,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769746519] [2020-07-10 14:42:39,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:39,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:42:39,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595520057] [2020-07-10 14:42:39,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 14:42:39,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:39,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:42:39,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:39,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:42:39,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:39,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:42:39,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:42:39,365 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 5 states. [2020-07-10 14:42:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:39,602 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2020-07-10 14:42:39,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:42:39,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-10 14:42:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-10 14:42:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-10 14:42:39,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2020-07-10 14:42:39,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:39,695 INFO L225 Difference]: With dead ends: 47 [2020-07-10 14:42:39,696 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 14:42:39,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 14:42:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-10 14:42:39,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:39,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 25 states. [2020-07-10 14:42:39,712 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 25 states. [2020-07-10 14:42:39,712 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 25 states. [2020-07-10 14:42:39,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:39,716 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-10 14:42:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-10 14:42:39,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:39,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:39,718 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states. [2020-07-10 14:42:39,718 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states. [2020-07-10 14:42:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:39,721 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-10 14:42:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-10 14:42:39,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:39,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:39,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:39,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 14:42:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-10 14:42:39,726 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2020-07-10 14:42:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:39,726 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-10 14:42:39,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:42:39,727 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-10 14:42:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 14:42:39,728 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:39,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:39,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 14:42:39,944 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:39,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1158269966, now seen corresponding path program 1 times [2020-07-10 14:42:39,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:39,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568402776] [2020-07-10 14:42:39,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:39,957 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 14:42:39,957 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878109486] [2020-07-10 14:42:39,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:39,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 14:42:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:40,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:42:40,082 INFO L263 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2020-07-10 14:42:40,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {437#true} assume true; {437#true} is VALID [2020-07-10 14:42:40,083 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {437#true} {437#true} #61#return; {437#true} is VALID [2020-07-10 14:42:40,083 INFO L263 TraceCheckUtils]: 3: Hoare triple {437#true} call #t~ret1 := main(); {437#true} is VALID [2020-07-10 14:42:40,084 INFO L280 TraceCheckUtils]: 4: Hoare triple {437#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {454#(<= 18 main_~y~0)} is VALID [2020-07-10 14:42:40,084 INFO L263 TraceCheckUtils]: 5: Hoare triple {454#(<= 18 main_~y~0)} call #t~ret0 := gcd_test(~x~0, ~y~0); {437#true} is VALID [2020-07-10 14:42:40,085 INFO L280 TraceCheckUtils]: 6: Hoare triple {437#true} ~a := #in~a;~b := #in~b; {461#(<= |gcd_test_#in~b| gcd_test_~b)} is VALID [2020-07-10 14:42:40,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {461#(<= |gcd_test_#in~b| gcd_test_~b)} assume !(~a < 0); {461#(<= |gcd_test_#in~b| gcd_test_~b)} is VALID [2020-07-10 14:42:40,087 INFO L280 TraceCheckUtils]: 8: Hoare triple {461#(<= |gcd_test_#in~b| gcd_test_~b)} assume ~b < 0;~b := -~b; {468#(<= (+ |gcd_test_#in~b| 1) 0)} is VALID [2020-07-10 14:42:40,088 INFO L280 TraceCheckUtils]: 9: Hoare triple {468#(<= (+ |gcd_test_#in~b| 1) 0)} assume !(0 == ~a); {468#(<= (+ |gcd_test_#in~b| 1) 0)} is VALID [2020-07-10 14:42:40,088 INFO L280 TraceCheckUtils]: 10: Hoare triple {468#(<= (+ |gcd_test_#in~b| 1) 0)} assume !(0 != ~b); {468#(<= (+ |gcd_test_#in~b| 1) 0)} is VALID [2020-07-10 14:42:40,089 INFO L280 TraceCheckUtils]: 11: Hoare triple {468#(<= (+ |gcd_test_#in~b| 1) 0)} #res := ~a; {468#(<= (+ |gcd_test_#in~b| 1) 0)} is VALID [2020-07-10 14:42:40,090 INFO L280 TraceCheckUtils]: 12: Hoare triple {468#(<= (+ |gcd_test_#in~b| 1) 0)} assume true; {468#(<= (+ |gcd_test_#in~b| 1) 0)} is VALID [2020-07-10 14:42:40,091 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {468#(<= (+ |gcd_test_#in~b| 1) 0)} {454#(<= 18 main_~y~0)} #65#return; {438#false} is VALID [2020-07-10 14:42:40,092 INFO L280 TraceCheckUtils]: 14: Hoare triple {438#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {438#false} is VALID [2020-07-10 14:42:40,092 INFO L263 TraceCheckUtils]: 15: Hoare triple {438#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {438#false} is VALID [2020-07-10 14:42:40,092 INFO L280 TraceCheckUtils]: 16: Hoare triple {438#false} ~cond := #in~cond; {438#false} is VALID [2020-07-10 14:42:40,093 INFO L280 TraceCheckUtils]: 17: Hoare triple {438#false} assume 0 == ~cond; {438#false} is VALID [2020-07-10 14:42:40,093 INFO L280 TraceCheckUtils]: 18: Hoare triple {438#false} assume !false; {438#false} is VALID [2020-07-10 14:42:40,094 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-10 14:42:40,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568402776] [2020-07-10 14:42:40,095 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 14:42:40,095 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878109486] [2020-07-10 14:42:40,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:40,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:42:40,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581139589] [2020-07-10 14:42:40,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 14:42:40,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:40,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:42:40,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:40,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:42:40,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:40,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:42:40,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:42:40,126 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2020-07-10 14:42:40,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:40,336 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-07-10 14:42:40,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:42:40,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 14:42:40,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-10 14:42:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-10 14:42:40,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2020-07-10 14:42:40,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:40,435 INFO L225 Difference]: With dead ends: 46 [2020-07-10 14:42:40,436 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 14:42:40,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 14:42:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-10 14:42:40,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:40,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 25 states. [2020-07-10 14:42:40,450 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 25 states. [2020-07-10 14:42:40,451 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 25 states. [2020-07-10 14:42:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:40,453 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-10 14:42:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-10 14:42:40,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:40,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:40,455 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states. [2020-07-10 14:42:40,455 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states. [2020-07-10 14:42:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:40,458 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-10 14:42:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-10 14:42:40,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:40,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:40,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:40,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:40,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 14:42:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-10 14:42:40,461 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2020-07-10 14:42:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:40,462 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-10 14:42:40,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:42:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-10 14:42:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 14:42:40,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:40,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:40,678 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:40,679 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash -457205388, now seen corresponding path program 1 times [2020-07-10 14:42:40,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:40,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854038647] [2020-07-10 14:42:40,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:40,691 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 14:42:40,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2040701866] [2020-07-10 14:42:40,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:40,732 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 14:42:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:40,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:42:40,834 INFO L263 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2020-07-10 14:42:40,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2020-07-10 14:42:40,835 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #61#return; {659#true} is VALID [2020-07-10 14:42:40,835 INFO L263 TraceCheckUtils]: 3: Hoare triple {659#true} call #t~ret1 := main(); {659#true} is VALID [2020-07-10 14:42:40,839 INFO L280 TraceCheckUtils]: 4: Hoare triple {659#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {676#(<= 18 main_~y~0)} is VALID [2020-07-10 14:42:40,840 INFO L263 TraceCheckUtils]: 5: Hoare triple {676#(<= 18 main_~y~0)} call #t~ret0 := gcd_test(~x~0, ~y~0); {659#true} is VALID [2020-07-10 14:42:40,842 INFO L280 TraceCheckUtils]: 6: Hoare triple {659#true} ~a := #in~a;~b := #in~b; {683#(<= |gcd_test_#in~b| gcd_test_~b)} is VALID [2020-07-10 14:42:40,843 INFO L280 TraceCheckUtils]: 7: Hoare triple {683#(<= |gcd_test_#in~b| gcd_test_~b)} assume !(~a < 0); {683#(<= |gcd_test_#in~b| gcd_test_~b)} is VALID [2020-07-10 14:42:40,844 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#(<= |gcd_test_#in~b| gcd_test_~b)} assume !(~b < 0); {683#(<= |gcd_test_#in~b| gcd_test_~b)} is VALID [2020-07-10 14:42:40,845 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#(<= |gcd_test_#in~b| gcd_test_~b)} assume !(0 == ~a); {683#(<= |gcd_test_#in~b| gcd_test_~b)} is VALID [2020-07-10 14:42:40,846 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#(<= |gcd_test_#in~b| gcd_test_~b)} assume !(0 != ~b); {696#(<= |gcd_test_#in~b| 0)} is VALID [2020-07-10 14:42:40,847 INFO L280 TraceCheckUtils]: 11: Hoare triple {696#(<= |gcd_test_#in~b| 0)} #res := ~a; {696#(<= |gcd_test_#in~b| 0)} is VALID [2020-07-10 14:42:40,847 INFO L280 TraceCheckUtils]: 12: Hoare triple {696#(<= |gcd_test_#in~b| 0)} assume true; {696#(<= |gcd_test_#in~b| 0)} is VALID [2020-07-10 14:42:40,849 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {696#(<= |gcd_test_#in~b| 0)} {676#(<= 18 main_~y~0)} #65#return; {660#false} is VALID [2020-07-10 14:42:40,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {660#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {660#false} is VALID [2020-07-10 14:42:40,850 INFO L263 TraceCheckUtils]: 15: Hoare triple {660#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {660#false} is VALID [2020-07-10 14:42:40,850 INFO L280 TraceCheckUtils]: 16: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2020-07-10 14:42:40,851 INFO L280 TraceCheckUtils]: 17: Hoare triple {660#false} assume 0 == ~cond; {660#false} is VALID [2020-07-10 14:42:40,851 INFO L280 TraceCheckUtils]: 18: Hoare triple {660#false} assume !false; {660#false} is VALID [2020-07-10 14:42:40,852 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-10 14:42:40,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854038647] [2020-07-10 14:42:40,853 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 14:42:40,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040701866] [2020-07-10 14:42:40,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:42:40,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:42:40,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602156953] [2020-07-10 14:42:40,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 14:42:40,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:40,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:42:40,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:40,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:42:40,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:42:40,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:42:40,885 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2020-07-10 14:42:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:41,078 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-10 14:42:41,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:42:41,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-10 14:42:41,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:41,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2020-07-10 14:42:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:42:41,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2020-07-10 14:42:41,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2020-07-10 14:42:41,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:41,159 INFO L225 Difference]: With dead ends: 40 [2020-07-10 14:42:41,159 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 14:42:41,160 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 14:42:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-10 14:42:41,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:41,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-10 14:42:41,180 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:42:41,180 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:42:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:41,187 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-10 14:42:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-10 14:42:41,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:41,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:41,189 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:42:41,189 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:42:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:41,193 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-10 14:42:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-10 14:42:41,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:41,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:41,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:41,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 14:42:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-10 14:42:41,199 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2020-07-10 14:42:41,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:41,202 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-10 14:42:41,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:42:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-10 14:42:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 14:42:41,203 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:41,204 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] [2020-07-10 14:42:41,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:41,405 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:41,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:41,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1431348209, now seen corresponding path program 1 times [2020-07-10 14:42:41,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:41,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817195019] [2020-07-10 14:42:41,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:41,417 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 14:42:41,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923409374] [2020-07-10 14:42:41,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:41,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 14:42:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:41,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:42:41,589 INFO L263 TraceCheckUtils]: 0: Hoare triple {871#true} call ULTIMATE.init(); {871#true} is VALID [2020-07-10 14:42:41,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {871#true} assume true; {871#true} is VALID [2020-07-10 14:42:41,590 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {871#true} {871#true} #61#return; {871#true} is VALID [2020-07-10 14:42:41,590 INFO L263 TraceCheckUtils]: 3: Hoare triple {871#true} call #t~ret1 := main(); {871#true} is VALID [2020-07-10 14:42:41,591 INFO L280 TraceCheckUtils]: 4: Hoare triple {871#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {888#(and (<= main_~y~0 18) (<= 63 main_~x~0))} is VALID [2020-07-10 14:42:41,591 INFO L263 TraceCheckUtils]: 5: Hoare triple {888#(and (<= main_~y~0 18) (<= 63 main_~x~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {871#true} is VALID [2020-07-10 14:42:41,592 INFO L280 TraceCheckUtils]: 6: Hoare triple {871#true} ~a := #in~a;~b := #in~b; {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:41,593 INFO L280 TraceCheckUtils]: 7: Hoare triple {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~a < 0); {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:41,593 INFO L280 TraceCheckUtils]: 8: Hoare triple {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~b < 0); {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:41,594 INFO L280 TraceCheckUtils]: 9: Hoare triple {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(0 == ~a); {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:41,595 INFO L280 TraceCheckUtils]: 10: Hoare triple {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !!(0 != ~b); {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:41,596 INFO L280 TraceCheckUtils]: 11: Hoare triple {895#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~a > ~b);~b := ~b - ~a; {911#(<= (+ gcd_test_~b |gcd_test_#in~a|) |gcd_test_#in~b|)} is VALID [2020-07-10 14:42:41,597 INFO L280 TraceCheckUtils]: 12: Hoare triple {911#(<= (+ gcd_test_~b |gcd_test_#in~a|) |gcd_test_#in~b|)} assume !(0 != ~b); {915#(<= |gcd_test_#in~a| |gcd_test_#in~b|)} is VALID [2020-07-10 14:42:41,598 INFO L280 TraceCheckUtils]: 13: Hoare triple {915#(<= |gcd_test_#in~a| |gcd_test_#in~b|)} #res := ~a; {915#(<= |gcd_test_#in~a| |gcd_test_#in~b|)} is VALID [2020-07-10 14:42:41,598 INFO L280 TraceCheckUtils]: 14: Hoare triple {915#(<= |gcd_test_#in~a| |gcd_test_#in~b|)} assume true; {915#(<= |gcd_test_#in~a| |gcd_test_#in~b|)} is VALID [2020-07-10 14:42:41,600 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {915#(<= |gcd_test_#in~a| |gcd_test_#in~b|)} {888#(and (<= main_~y~0 18) (<= 63 main_~x~0))} #65#return; {872#false} is VALID [2020-07-10 14:42:41,600 INFO L280 TraceCheckUtils]: 16: Hoare triple {872#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {872#false} is VALID [2020-07-10 14:42:41,601 INFO L263 TraceCheckUtils]: 17: Hoare triple {872#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {872#false} is VALID [2020-07-10 14:42:41,601 INFO L280 TraceCheckUtils]: 18: Hoare triple {872#false} ~cond := #in~cond; {872#false} is VALID [2020-07-10 14:42:41,601 INFO L280 TraceCheckUtils]: 19: Hoare triple {872#false} assume 0 == ~cond; {872#false} is VALID [2020-07-10 14:42:41,601 INFO L280 TraceCheckUtils]: 20: Hoare triple {872#false} assume !false; {872#false} is VALID [2020-07-10 14:42:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:41,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817195019] [2020-07-10 14:42:41,603 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 14:42:41,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923409374] [2020-07-10 14:42:41,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:42:41,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-10 14:42:41,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731329169] [2020-07-10 14:42:41,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-10 14:42:41,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:41,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 14:42:41,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:41,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 14:42:41,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 14:42:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 14:42:41,630 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2020-07-10 14:42:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:41,951 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-07-10 14:42:41,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 14:42:41,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-10 14:42:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-10 14:42:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 14:42:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-10 14:42:41,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2020-07-10 14:42:42,034 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-10 14:42:42,037 INFO L225 Difference]: With dead ends: 46 [2020-07-10 14:42:42,037 INFO L226 Difference]: Without dead ends: 29 [2020-07-10 14:42:42,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:42:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-10 14:42:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-10 14:42:42,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:42,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-10 14:42:42,068 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 14:42:42,068 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 14:42:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:42,070 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 14:42:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 14:42:42,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:42,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:42,075 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-10 14:42:42,075 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-10 14:42:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:42,079 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-10 14:42:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 14:42:42,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:42,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:42,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:42,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 14:42:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-10 14:42:42,087 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2020-07-10 14:42:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:42,087 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-10 14:42:42,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 14:42:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 14:42:42,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 14:42:42,088 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:42,089 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:42,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:42,296 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:42,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1537894100, now seen corresponding path program 1 times [2020-07-10 14:42:42,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:42,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332685915] [2020-07-10 14:42:42,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:42,311 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 14:42:42,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161198819] [2020-07-10 14:42:42,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:42,338 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 14:42:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:42,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:42:42,534 INFO L263 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2020-07-10 14:42:42,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-10 14:42:42,535 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1106#true} {1106#true} #61#return; {1106#true} is VALID [2020-07-10 14:42:42,535 INFO L263 TraceCheckUtils]: 3: Hoare triple {1106#true} call #t~ret1 := main(); {1106#true} is VALID [2020-07-10 14:42:42,537 INFO L280 TraceCheckUtils]: 4: Hoare triple {1106#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {1123#(and (<= main_~y~0 18) (<= 63 main_~x~0))} is VALID [2020-07-10 14:42:42,537 INFO L263 TraceCheckUtils]: 5: Hoare triple {1123#(and (<= main_~y~0 18) (<= 63 main_~x~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {1106#true} is VALID [2020-07-10 14:42:42,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {1106#true} ~a := #in~a;~b := #in~b; {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:42,540 INFO L280 TraceCheckUtils]: 7: Hoare triple {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~a < 0); {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:42,541 INFO L280 TraceCheckUtils]: 8: Hoare triple {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~b < 0); {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:42,541 INFO L280 TraceCheckUtils]: 9: Hoare triple {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(0 == ~a); {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:42,544 INFO L280 TraceCheckUtils]: 10: Hoare triple {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !!(0 != ~b); {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:42,545 INFO L280 TraceCheckUtils]: 11: Hoare triple {1130#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume ~a > ~b;~a := ~a - ~b; {1146#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:42:42,546 INFO L280 TraceCheckUtils]: 12: Hoare triple {1146#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume !!(0 != ~b); {1146#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:42:42,547 INFO L280 TraceCheckUtils]: 13: Hoare triple {1146#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume !(~a > ~b);~b := ~b - ~a; {1153#(<= (+ gcd_test_~b |gcd_test_#in~a|) (* 2 |gcd_test_#in~b|))} is VALID [2020-07-10 14:42:42,548 INFO L280 TraceCheckUtils]: 14: Hoare triple {1153#(<= (+ gcd_test_~b |gcd_test_#in~a|) (* 2 |gcd_test_#in~b|))} assume !(0 != ~b); {1157#(<= |gcd_test_#in~a| (* 2 |gcd_test_#in~b|))} is VALID [2020-07-10 14:42:42,548 INFO L280 TraceCheckUtils]: 15: Hoare triple {1157#(<= |gcd_test_#in~a| (* 2 |gcd_test_#in~b|))} #res := ~a; {1157#(<= |gcd_test_#in~a| (* 2 |gcd_test_#in~b|))} is VALID [2020-07-10 14:42:42,549 INFO L280 TraceCheckUtils]: 16: Hoare triple {1157#(<= |gcd_test_#in~a| (* 2 |gcd_test_#in~b|))} assume true; {1157#(<= |gcd_test_#in~a| (* 2 |gcd_test_#in~b|))} is VALID [2020-07-10 14:42:42,550 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1157#(<= |gcd_test_#in~a| (* 2 |gcd_test_#in~b|))} {1123#(and (<= main_~y~0 18) (<= 63 main_~x~0))} #65#return; {1107#false} is VALID [2020-07-10 14:42:42,551 INFO L280 TraceCheckUtils]: 18: Hoare triple {1107#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {1107#false} is VALID [2020-07-10 14:42:42,551 INFO L263 TraceCheckUtils]: 19: Hoare triple {1107#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {1107#false} is VALID [2020-07-10 14:42:42,551 INFO L280 TraceCheckUtils]: 20: Hoare triple {1107#false} ~cond := #in~cond; {1107#false} is VALID [2020-07-10 14:42:42,552 INFO L280 TraceCheckUtils]: 21: Hoare triple {1107#false} assume 0 == ~cond; {1107#false} is VALID [2020-07-10 14:42:42,552 INFO L280 TraceCheckUtils]: 22: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2020-07-10 14:42:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:42,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332685915] [2020-07-10 14:42:42,554 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 14:42:42,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161198819] [2020-07-10 14:42:42,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:42:42,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-10 14:42:42,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891466853] [2020-07-10 14:42:42,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-10 14:42:42,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:42,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:42:42,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:42,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:42:42,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:42,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:42:42,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:42:42,601 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2020-07-10 14:42:42,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:42,969 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-10 14:42:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:42:42,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-10 14:42:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:42:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2020-07-10 14:42:42,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:42:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2020-07-10 14:42:42,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2020-07-10 14:42:43,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:43,045 INFO L225 Difference]: With dead ends: 48 [2020-07-10 14:42:43,047 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 14:42:43,048 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-10 14:42:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 14:42:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-10 14:42:43,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:43,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-10 14:42:43,083 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 14:42:43,083 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 14:42:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:43,085 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-10 14:42:43,085 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 14:42:43,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:43,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:43,086 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 14:42:43,086 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 14:42:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:43,088 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-10 14:42:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 14:42:43,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:43,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:43,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:43,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 14:42:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-10 14:42:43,091 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2020-07-10 14:42:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:43,091 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-10 14:42:43,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:42:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 14:42:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 14:42:43,092 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:43,093 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:43,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-10 14:42:43,306 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:43,307 INFO L82 PathProgramCache]: Analyzing trace with hash -849280247, now seen corresponding path program 2 times [2020-07-10 14:42:43,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:43,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794612208] [2020-07-10 14:42:43,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:43,323 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 14:42:43,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683487971] [2020-07-10 14:42:43,324 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:43,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:42:43,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:42:43,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 14:42:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:43,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:42:43,720 INFO L263 TraceCheckUtils]: 0: Hoare triple {1360#true} call ULTIMATE.init(); {1360#true} is VALID [2020-07-10 14:42:43,721 INFO L280 TraceCheckUtils]: 1: Hoare triple {1360#true} assume true; {1360#true} is VALID [2020-07-10 14:42:43,721 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1360#true} {1360#true} #61#return; {1360#true} is VALID [2020-07-10 14:42:43,721 INFO L263 TraceCheckUtils]: 3: Hoare triple {1360#true} call #t~ret1 := main(); {1360#true} is VALID [2020-07-10 14:42:43,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {1360#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {1377#(and (<= main_~y~0 18) (<= 63 main_~x~0))} is VALID [2020-07-10 14:42:43,724 INFO L263 TraceCheckUtils]: 5: Hoare triple {1377#(and (<= main_~y~0 18) (<= 63 main_~x~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {1360#true} is VALID [2020-07-10 14:42:43,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {1360#true} ~a := #in~a;~b := #in~b; {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:43,726 INFO L280 TraceCheckUtils]: 7: Hoare triple {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~a < 0); {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:43,730 INFO L280 TraceCheckUtils]: 8: Hoare triple {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~b < 0); {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:43,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(0 == ~a); {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:43,732 INFO L280 TraceCheckUtils]: 10: Hoare triple {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !!(0 != ~b); {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:42:43,733 INFO L280 TraceCheckUtils]: 11: Hoare triple {1384#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume ~a > ~b;~a := ~a - ~b; {1400#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:42:43,734 INFO L280 TraceCheckUtils]: 12: Hoare triple {1400#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume !!(0 != ~b); {1400#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:42:43,736 INFO L280 TraceCheckUtils]: 13: Hoare triple {1400#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {1407#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:42:43,737 INFO L280 TraceCheckUtils]: 14: Hoare triple {1407#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {1407#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:42:43,738 INFO L280 TraceCheckUtils]: 15: Hoare triple {1407#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume !(~a > ~b);~b := ~b - ~a; {1414#(<= (div (+ (* gcd_test_~b (- 1)) (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)} is VALID [2020-07-10 14:42:43,740 INFO L280 TraceCheckUtils]: 16: Hoare triple {1414#(<= (div (+ (* gcd_test_~b (- 1)) (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)} assume !(0 != ~b); {1418#(exists ((gcd_test_~b Int)) (and (<= (div (+ (* gcd_test_~b (- 1)) (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|) (<= 0 gcd_test_~b)))} is VALID [2020-07-10 14:42:43,741 INFO L280 TraceCheckUtils]: 17: Hoare triple {1418#(exists ((gcd_test_~b Int)) (and (<= (div (+ (* gcd_test_~b (- 1)) (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|) (<= 0 gcd_test_~b)))} #res := ~a; {1418#(exists ((gcd_test_~b Int)) (and (<= (div (+ (* gcd_test_~b (- 1)) (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|) (<= 0 gcd_test_~b)))} is VALID [2020-07-10 14:42:43,741 INFO L280 TraceCheckUtils]: 18: Hoare triple {1418#(exists ((gcd_test_~b Int)) (and (<= (div (+ (* gcd_test_~b (- 1)) (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|) (<= 0 gcd_test_~b)))} assume true; {1418#(exists ((gcd_test_~b Int)) (and (<= (div (+ (* gcd_test_~b (- 1)) (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|) (<= 0 gcd_test_~b)))} is VALID [2020-07-10 14:42:43,743 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1418#(exists ((gcd_test_~b Int)) (and (<= (div (+ (* gcd_test_~b (- 1)) (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|) (<= 0 gcd_test_~b)))} {1377#(and (<= main_~y~0 18) (<= 63 main_~x~0))} #65#return; {1361#false} is VALID [2020-07-10 14:42:43,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {1361#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {1361#false} is VALID [2020-07-10 14:42:43,743 INFO L263 TraceCheckUtils]: 21: Hoare triple {1361#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {1361#false} is VALID [2020-07-10 14:42:43,744 INFO L280 TraceCheckUtils]: 22: Hoare triple {1361#false} ~cond := #in~cond; {1361#false} is VALID [2020-07-10 14:42:43,744 INFO L280 TraceCheckUtils]: 23: Hoare triple {1361#false} assume 0 == ~cond; {1361#false} is VALID [2020-07-10 14:42:43,744 INFO L280 TraceCheckUtils]: 24: Hoare triple {1361#false} assume !false; {1361#false} is VALID [2020-07-10 14:42:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:43,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794612208] [2020-07-10 14:42:43,746 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 14:42:43,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683487971] [2020-07-10 14:42:43,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:42:43,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-10 14:42:43,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545797397] [2020-07-10 14:42:43,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-10 14:42:43,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:43,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 14:42:43,792 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-10 14:42:43,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 14:42:43,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:43,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 14:42:43,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 14:42:43,793 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2020-07-10 14:42:46,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:46,611 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2020-07-10 14:42:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 14:42:46,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-10 14:42:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:42:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-10 14:42:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 14:42:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-10 14:42:46,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2020-07-10 14:42:46,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:46,737 INFO L225 Difference]: With dead ends: 50 [2020-07-10 14:42:46,737 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 14:42:46,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:42:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 14:42:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-10 14:42:46,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:46,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-10 14:42:46,764 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 14:42:46,764 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 14:42:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:46,769 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 14:42:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 14:42:46,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:46,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:46,770 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-10 14:42:46,770 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-10 14:42:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:46,772 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 14:42:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 14:42:46,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:46,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:46,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:46,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 14:42:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-10 14:42:46,777 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2020-07-10 14:42:46,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:46,778 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-10 14:42:46,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 14:42:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 14:42:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:42:46,778 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:46,779 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:46,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:46,980 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:46,981 INFO L82 PathProgramCache]: Analyzing trace with hash -516331098, now seen corresponding path program 3 times [2020-07-10 14:42:46,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:46,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567344817] [2020-07-10 14:42:46,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:47,043 INFO L280 TraceCheckUtils]: 0: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-10 14:42:47,043 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1633#true} {1633#true} #61#return; {1633#true} is VALID [2020-07-10 14:42:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:47,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {1633#true} ~a := #in~a;~b := #in~b; {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~a < 0); {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,255 INFO L280 TraceCheckUtils]: 2: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~b < 0); {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,255 INFO L280 TraceCheckUtils]: 3: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(0 == ~a); {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,256 INFO L280 TraceCheckUtils]: 4: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !!(0 != ~b); {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,256 INFO L280 TraceCheckUtils]: 5: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {1655#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,257 INFO L280 TraceCheckUtils]: 6: Hoare triple {1655#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {1655#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,258 INFO L280 TraceCheckUtils]: 7: Hoare triple {1655#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {1656#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {1656#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {1656#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,260 INFO L280 TraceCheckUtils]: 9: Hoare triple {1656#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {1657#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,260 INFO L280 TraceCheckUtils]: 10: Hoare triple {1657#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {1657#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,261 INFO L280 TraceCheckUtils]: 11: Hoare triple {1657#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !(~a > ~b);~b := ~b - ~a; {1658#(<= (* 4 |gcd_test_#in~b|) (+ gcd_test_~b |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,262 INFO L280 TraceCheckUtils]: 12: Hoare triple {1658#(<= (* 4 |gcd_test_#in~b|) (+ gcd_test_~b |gcd_test_#in~a|))} assume !(0 != ~b); {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:47,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} #res := ~a; {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:47,263 INFO L280 TraceCheckUtils]: 14: Hoare triple {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} assume true; {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:47,264 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} {1637#(<= (+ main_~x~0 9) (* 4 main_~y~0))} #65#return; {1634#false} is VALID [2020-07-10 14:42:47,265 INFO L263 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2020-07-10 14:42:47,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-10 14:42:47,265 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #61#return; {1633#true} is VALID [2020-07-10 14:42:47,265 INFO L263 TraceCheckUtils]: 3: Hoare triple {1633#true} call #t~ret1 := main(); {1633#true} is VALID [2020-07-10 14:42:47,267 INFO L280 TraceCheckUtils]: 4: Hoare triple {1633#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {1637#(<= (+ main_~x~0 9) (* 4 main_~y~0))} is VALID [2020-07-10 14:42:47,267 INFO L263 TraceCheckUtils]: 5: Hoare triple {1637#(<= (+ main_~x~0 9) (* 4 main_~y~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {1633#true} is VALID [2020-07-10 14:42:47,268 INFO L280 TraceCheckUtils]: 6: Hoare triple {1633#true} ~a := #in~a;~b := #in~b; {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,275 INFO L280 TraceCheckUtils]: 7: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~a < 0); {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,275 INFO L280 TraceCheckUtils]: 8: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~b < 0); {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(0 == ~a); {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !!(0 != ~b); {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,277 INFO L280 TraceCheckUtils]: 11: Hoare triple {1654#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {1655#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,278 INFO L280 TraceCheckUtils]: 12: Hoare triple {1655#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {1655#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,279 INFO L280 TraceCheckUtils]: 13: Hoare triple {1655#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {1656#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,279 INFO L280 TraceCheckUtils]: 14: Hoare triple {1656#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {1656#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,280 INFO L280 TraceCheckUtils]: 15: Hoare triple {1656#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {1657#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,281 INFO L280 TraceCheckUtils]: 16: Hoare triple {1657#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {1657#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,282 INFO L280 TraceCheckUtils]: 17: Hoare triple {1657#(and (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !(~a > ~b);~b := ~b - ~a; {1658#(<= (* 4 |gcd_test_#in~b|) (+ gcd_test_~b |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:47,283 INFO L280 TraceCheckUtils]: 18: Hoare triple {1658#(<= (* 4 |gcd_test_#in~b|) (+ gcd_test_~b |gcd_test_#in~a|))} assume !(0 != ~b); {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:47,283 INFO L280 TraceCheckUtils]: 19: Hoare triple {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} #res := ~a; {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:47,284 INFO L280 TraceCheckUtils]: 20: Hoare triple {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} assume true; {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:47,285 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} {1637#(<= (+ main_~x~0 9) (* 4 main_~y~0))} #65#return; {1634#false} is VALID [2020-07-10 14:42:47,285 INFO L280 TraceCheckUtils]: 22: Hoare triple {1634#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {1634#false} is VALID [2020-07-10 14:42:47,285 INFO L263 TraceCheckUtils]: 23: Hoare triple {1634#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {1634#false} is VALID [2020-07-10 14:42:47,285 INFO L280 TraceCheckUtils]: 24: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2020-07-10 14:42:47,286 INFO L280 TraceCheckUtils]: 25: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2020-07-10 14:42:47,286 INFO L280 TraceCheckUtils]: 26: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2020-07-10 14:42:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:47,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567344817] [2020-07-10 14:42:47,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180657938] [2020-07-10 14:42:47,288 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:47,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-10 14:42:47,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:42:47,323 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-10 14:42:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:47,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:42:49,338 INFO L263 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2020-07-10 14:42:49,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-10 14:42:49,338 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #61#return; {1633#true} is VALID [2020-07-10 14:42:49,339 INFO L263 TraceCheckUtils]: 3: Hoare triple {1633#true} call #t~ret1 := main(); {1633#true} is VALID [2020-07-10 14:42:49,340 INFO L280 TraceCheckUtils]: 4: Hoare triple {1633#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {1675#(and (<= main_~x~0 63) (<= 18 main_~y~0))} is VALID [2020-07-10 14:42:49,341 INFO L263 TraceCheckUtils]: 5: Hoare triple {1675#(and (<= main_~x~0 63) (<= 18 main_~y~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {1633#true} is VALID [2020-07-10 14:42:49,341 INFO L280 TraceCheckUtils]: 6: Hoare triple {1633#true} ~a := #in~a;~b := #in~b; {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,349 INFO L280 TraceCheckUtils]: 7: Hoare triple {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !(~a < 0); {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,350 INFO L280 TraceCheckUtils]: 8: Hoare triple {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !(~b < 0); {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,350 INFO L280 TraceCheckUtils]: 9: Hoare triple {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !(0 == ~a); {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,351 INFO L280 TraceCheckUtils]: 10: Hoare triple {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !!(0 != ~b); {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {1682#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume ~a > ~b;~a := ~a - ~b; {1698#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {1698#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !!(0 != ~b); {1698#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,355 INFO L280 TraceCheckUtils]: 13: Hoare triple {1698#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume ~a > ~b;~a := ~a - ~b; {1705#(and (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,356 INFO L280 TraceCheckUtils]: 14: Hoare triple {1705#(and (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !!(0 != ~b); {1705#(and (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,358 INFO L280 TraceCheckUtils]: 15: Hoare triple {1705#(and (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume ~a > ~b;~a := ~a - ~b; {1712#(and (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,359 INFO L280 TraceCheckUtils]: 16: Hoare triple {1712#(and (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !!(0 != ~b); {1712#(and (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:42:49,362 INFO L280 TraceCheckUtils]: 17: Hoare triple {1712#(and (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !(~a > ~b);~b := ~b - ~a; {1719#(exists ((gcd_test_~a Int)) (and (<= |gcd_test_#in~b| (+ gcd_test_~b gcd_test_~a)) (<= |gcd_test_#in~b| (div (+ (* gcd_test_~a (- 1)) |gcd_test_#in~a|) 3))))} is VALID [2020-07-10 14:42:49,364 INFO L280 TraceCheckUtils]: 18: Hoare triple {1719#(exists ((gcd_test_~a Int)) (and (<= |gcd_test_#in~b| (+ gcd_test_~b gcd_test_~a)) (<= |gcd_test_#in~b| (div (+ (* gcd_test_~a (- 1)) |gcd_test_#in~a|) 3))))} assume !(0 != ~b); {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:49,365 INFO L280 TraceCheckUtils]: 19: Hoare triple {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} #res := ~a; {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:49,366 INFO L280 TraceCheckUtils]: 20: Hoare triple {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} assume true; {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:49,368 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1659#(<= (* 4 |gcd_test_#in~b|) |gcd_test_#in~a|)} {1675#(and (<= main_~x~0 63) (<= 18 main_~y~0))} #65#return; {1634#false} is VALID [2020-07-10 14:42:49,368 INFO L280 TraceCheckUtils]: 22: Hoare triple {1634#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {1634#false} is VALID [2020-07-10 14:42:49,369 INFO L263 TraceCheckUtils]: 23: Hoare triple {1634#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {1634#false} is VALID [2020-07-10 14:42:49,369 INFO L280 TraceCheckUtils]: 24: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2020-07-10 14:42:49,369 INFO L280 TraceCheckUtils]: 25: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2020-07-10 14:42:49,370 INFO L280 TraceCheckUtils]: 26: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2020-07-10 14:42:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:49,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:42:49,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-07-10 14:42:49,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303389133] [2020-07-10 14:42:49,373 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-07-10 14:42:49,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:49,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 14:42:49,433 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-10 14:42:49,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 14:42:49,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:49,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 14:42:49,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=176, Unknown=1, NotChecked=0, Total=210 [2020-07-10 14:42:49,434 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 15 states. [2020-07-10 14:42:56,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:56,646 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2020-07-10 14:42:56,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 14:42:56,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-07-10 14:42:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:42:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2020-07-10 14:42:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:42:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2020-07-10 14:42:56,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 59 transitions. [2020-07-10 14:42:56,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:56,771 INFO L225 Difference]: With dead ends: 52 [2020-07-10 14:42:56,771 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 14:42:56,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=44, Invalid=227, Unknown=1, NotChecked=0, Total=272 [2020-07-10 14:42:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 14:42:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-10 14:42:56,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:56,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-10 14:42:56,808 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 14:42:56,808 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 14:42:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:56,811 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 14:42:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 14:42:56,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:56,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:56,811 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 14:42:56,811 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 14:42:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:56,813 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 14:42:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 14:42:56,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:56,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:56,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:56,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 14:42:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-10 14:42:56,816 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2020-07-10 14:42:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:56,816 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-10 14:42:56,816 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 14:42:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 14:42:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 14:42:56,817 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:56,817 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:57,028 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:57,029 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1878386625, now seen corresponding path program 4 times [2020-07-10 14:42:57,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:57,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467878154] [2020-07-10 14:42:57,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:57,043 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 14:42:57,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705516392] [2020-07-10 14:42:57,044 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:42:57,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-10 14:42:57,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:42:57,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-10 14:42:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:57,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:42:57,487 INFO L263 TraceCheckUtils]: 0: Hoare triple {1945#true} call ULTIMATE.init(); {1945#true} is VALID [2020-07-10 14:42:57,488 INFO L280 TraceCheckUtils]: 1: Hoare triple {1945#true} assume true; {1945#true} is VALID [2020-07-10 14:42:57,488 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1945#true} {1945#true} #61#return; {1945#true} is VALID [2020-07-10 14:42:57,489 INFO L263 TraceCheckUtils]: 3: Hoare triple {1945#true} call #t~ret1 := main(); {1945#true} is VALID [2020-07-10 14:42:57,489 INFO L280 TraceCheckUtils]: 4: Hoare triple {1945#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {1962#(= 63 main_~x~0)} is VALID [2020-07-10 14:42:57,489 INFO L263 TraceCheckUtils]: 5: Hoare triple {1962#(= 63 main_~x~0)} call #t~ret0 := gcd_test(~x~0, ~y~0); {1945#true} is VALID [2020-07-10 14:42:57,490 INFO L280 TraceCheckUtils]: 6: Hoare triple {1945#true} ~a := #in~a;~b := #in~b; {1969#(= gcd_test_~a |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:57,490 INFO L280 TraceCheckUtils]: 7: Hoare triple {1969#(= gcd_test_~a |gcd_test_#in~a|)} assume !(~a < 0); {1969#(= gcd_test_~a |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:57,491 INFO L280 TraceCheckUtils]: 8: Hoare triple {1969#(= gcd_test_~a |gcd_test_#in~a|)} assume !(~b < 0); {1969#(= gcd_test_~a |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:57,491 INFO L280 TraceCheckUtils]: 9: Hoare triple {1969#(= gcd_test_~a |gcd_test_#in~a|)} assume !(0 == ~a); {1969#(= gcd_test_~a |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:57,492 INFO L280 TraceCheckUtils]: 10: Hoare triple {1969#(= gcd_test_~a |gcd_test_#in~a|)} assume !!(0 != ~b); {1969#(= gcd_test_~a |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:57,497 INFO L280 TraceCheckUtils]: 11: Hoare triple {1969#(= gcd_test_~a |gcd_test_#in~a|)} assume ~a > ~b;~a := ~a - ~b; {1985#(= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:57,498 INFO L280 TraceCheckUtils]: 12: Hoare triple {1985#(= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|)} assume !!(0 != ~b); {1985#(= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:57,499 INFO L280 TraceCheckUtils]: 13: Hoare triple {1985#(= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|)} assume ~a > ~b;~a := ~a - ~b; {1992#(= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:57,499 INFO L280 TraceCheckUtils]: 14: Hoare triple {1992#(= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|)} assume !!(0 != ~b); {1992#(= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|)} is VALID [2020-07-10 14:42:57,500 INFO L280 TraceCheckUtils]: 15: Hoare triple {1992#(= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|)} assume ~a > ~b;~a := ~a - ~b; {1999#(and (< 0 gcd_test_~a) (= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:57,501 INFO L280 TraceCheckUtils]: 16: Hoare triple {1999#(and (< 0 gcd_test_~a) (= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {1999#(and (< 0 gcd_test_~a) (= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:57,503 INFO L280 TraceCheckUtils]: 17: Hoare triple {1999#(and (< 0 gcd_test_~a) (= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !(~a > ~b);~b := ~b - ~a; {2006#(and (< 0 gcd_test_~a) (= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) (* 4 gcd_test_~a))))} is VALID [2020-07-10 14:42:57,504 INFO L280 TraceCheckUtils]: 18: Hoare triple {2006#(and (< 0 gcd_test_~a) (= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) (* 4 gcd_test_~a))))} assume !!(0 != ~b); {2006#(and (< 0 gcd_test_~a) (= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) (* 4 gcd_test_~a))))} is VALID [2020-07-10 14:42:57,505 INFO L280 TraceCheckUtils]: 19: Hoare triple {2006#(and (< 0 gcd_test_~a) (= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) (* 4 gcd_test_~a))))} assume !(~a > ~b);~b := ~b - ~a; {2013#(and (< 0 gcd_test_~a) (= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) (* 7 gcd_test_~a))))} is VALID [2020-07-10 14:42:57,505 INFO L280 TraceCheckUtils]: 20: Hoare triple {2013#(and (< 0 gcd_test_~a) (= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) (* 7 gcd_test_~a))))} assume !(0 != ~b); {2017#(and (< 0 gcd_test_~a) (= |gcd_test_#in~a| (* 7 gcd_test_~a)))} is VALID [2020-07-10 14:42:57,506 INFO L280 TraceCheckUtils]: 21: Hoare triple {2017#(and (< 0 gcd_test_~a) (= |gcd_test_#in~a| (* 7 gcd_test_~a)))} #res := ~a; {2021#(and (= (* 7 |gcd_test_#res|) |gcd_test_#in~a|) (< 0 |gcd_test_#res|))} is VALID [2020-07-10 14:42:57,507 INFO L280 TraceCheckUtils]: 22: Hoare triple {2021#(and (= (* 7 |gcd_test_#res|) |gcd_test_#in~a|) (< 0 |gcd_test_#res|))} assume true; {2021#(and (= (* 7 |gcd_test_#res|) |gcd_test_#in~a|) (< 0 |gcd_test_#res|))} is VALID [2020-07-10 14:42:57,508 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {2021#(and (= (* 7 |gcd_test_#res|) |gcd_test_#in~a|) (< 0 |gcd_test_#res|))} {1962#(= 63 main_~x~0)} #65#return; {2028#(and (= 63 main_~x~0) (= (* 7 |main_#t~ret0|) main_~x~0))} is VALID [2020-07-10 14:42:57,509 INFO L280 TraceCheckUtils]: 24: Hoare triple {2028#(and (= 63 main_~x~0) (= (* 7 |main_#t~ret0|) main_~x~0))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {2032#(and (= main_~x~0 (* 7 main_~g~0)) (= 63 main_~x~0))} is VALID [2020-07-10 14:42:57,510 INFO L263 TraceCheckUtils]: 25: Hoare triple {2032#(and (= main_~x~0 (* 7 main_~g~0)) (= 63 main_~x~0))} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 14:42:57,510 INFO L280 TraceCheckUtils]: 26: Hoare triple {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 14:42:57,511 INFO L280 TraceCheckUtils]: 27: Hoare triple {2040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1946#false} is VALID [2020-07-10 14:42:57,511 INFO L280 TraceCheckUtils]: 28: Hoare triple {1946#false} assume !false; {1946#false} is VALID [2020-07-10 14:42:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:57,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467878154] [2020-07-10 14:42:57,514 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 14:42:57,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705516392] [2020-07-10 14:42:57,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:42:57,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-10 14:42:57,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755828652] [2020-07-10 14:42:57,515 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2020-07-10 14:42:57,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:42:57,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 14:42:57,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:57,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 14:42:57,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:42:57,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 14:42:57,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:42:57,569 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 15 states. [2020-07-10 14:42:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:59,044 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-07-10 14:42:59,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 14:42:59,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2020-07-10 14:42:59,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:42:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:42:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2020-07-10 14:42:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 14:42:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2020-07-10 14:42:59,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 57 transitions. [2020-07-10 14:42:59,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:42:59,167 INFO L225 Difference]: With dead ends: 52 [2020-07-10 14:42:59,167 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 14:42:59,168 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-07-10 14:42:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 14:42:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2020-07-10 14:42:59,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:42:59,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2020-07-10 14:42:59,224 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2020-07-10 14:42:59,224 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2020-07-10 14:42:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:59,226 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-10 14:42:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2020-07-10 14:42:59,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:59,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:59,227 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2020-07-10 14:42:59,227 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2020-07-10 14:42:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:42:59,229 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-10 14:42:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2020-07-10 14:42:59,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:42:59,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:42:59,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:42:59,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:42:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 14:42:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2020-07-10 14:42:59,233 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 29 [2020-07-10 14:42:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:42:59,233 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2020-07-10 14:42:59,233 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 14:42:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-10 14:42:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 14:42:59,234 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:42:59,234 INFO L422 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:42:59,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-10 14:42:59,449 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:42:59,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:42:59,450 INFO L82 PathProgramCache]: Analyzing trace with hash 841482334, now seen corresponding path program 5 times [2020-07-10 14:42:59,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:42:59,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640160631] [2020-07-10 14:42:59,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:42:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:59,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {2293#true} assume true; {2293#true} is VALID [2020-07-10 14:42:59,524 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2293#true} {2293#true} #61#return; {2293#true} is VALID [2020-07-10 14:42:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:42:59,897 INFO L280 TraceCheckUtils]: 0: Hoare triple {2293#true} ~a := #in~a;~b := #in~b; {2318#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {2318#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~a < 0); {2318#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {2318#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~b < 0); {2319#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} is VALID [2020-07-10 14:42:59,908 INFO L280 TraceCheckUtils]: 3: Hoare triple {2319#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} assume !(0 == ~a); {2319#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} is VALID [2020-07-10 14:42:59,911 INFO L280 TraceCheckUtils]: 4: Hoare triple {2319#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} assume !!(0 != ~b); {2320#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,913 INFO L280 TraceCheckUtils]: 5: Hoare triple {2320#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {2321#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,914 INFO L280 TraceCheckUtils]: 6: Hoare triple {2321#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {2321#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,916 INFO L280 TraceCheckUtils]: 7: Hoare triple {2321#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {2322#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,917 INFO L280 TraceCheckUtils]: 8: Hoare triple {2322#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {2322#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,919 INFO L280 TraceCheckUtils]: 9: Hoare triple {2322#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {2323#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,920 INFO L280 TraceCheckUtils]: 10: Hoare triple {2323#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {2323#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,921 INFO L280 TraceCheckUtils]: 11: Hoare triple {2323#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !(~a > ~b);~b := ~b - ~a; {2324#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 4 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,923 INFO L280 TraceCheckUtils]: 12: Hoare triple {2324#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 4 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume !!(0 != ~b); {2324#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 4 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,925 INFO L280 TraceCheckUtils]: 13: Hoare triple {2324#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 4 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume ~a > ~b;~a := ~a - ~b; {2325#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,926 INFO L280 TraceCheckUtils]: 14: Hoare triple {2325#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume !!(0 != ~b); {2325#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {2325#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume !(~a > ~b);~b := ~b - ~a; {2326#(<= (+ (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,929 INFO L280 TraceCheckUtils]: 16: Hoare triple {2326#(<= (+ (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume !(0 != ~b); {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,930 INFO L280 TraceCheckUtils]: 17: Hoare triple {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} #res := ~a; {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,931 INFO L280 TraceCheckUtils]: 18: Hoare triple {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} assume true; {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,933 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} {2297#(<= (* 2 main_~x~0) (* 7 main_~y~0))} #65#return; {2294#false} is VALID [2020-07-10 14:42:59,937 INFO L263 TraceCheckUtils]: 0: Hoare triple {2293#true} call ULTIMATE.init(); {2293#true} is VALID [2020-07-10 14:42:59,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {2293#true} assume true; {2293#true} is VALID [2020-07-10 14:42:59,938 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2293#true} {2293#true} #61#return; {2293#true} is VALID [2020-07-10 14:42:59,938 INFO L263 TraceCheckUtils]: 3: Hoare triple {2293#true} call #t~ret1 := main(); {2293#true} is VALID [2020-07-10 14:42:59,939 INFO L280 TraceCheckUtils]: 4: Hoare triple {2293#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {2297#(<= (* 2 main_~x~0) (* 7 main_~y~0))} is VALID [2020-07-10 14:42:59,940 INFO L263 TraceCheckUtils]: 5: Hoare triple {2297#(<= (* 2 main_~x~0) (* 7 main_~y~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {2293#true} is VALID [2020-07-10 14:42:59,941 INFO L280 TraceCheckUtils]: 6: Hoare triple {2293#true} ~a := #in~a;~b := #in~b; {2318#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,941 INFO L280 TraceCheckUtils]: 7: Hoare triple {2318#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~a < 0); {2318#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,942 INFO L280 TraceCheckUtils]: 8: Hoare triple {2318#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~b < 0); {2319#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} is VALID [2020-07-10 14:42:59,943 INFO L280 TraceCheckUtils]: 9: Hoare triple {2319#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} assume !(0 == ~a); {2319#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} is VALID [2020-07-10 14:42:59,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {2319#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} assume !!(0 != ~b); {2320#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,945 INFO L280 TraceCheckUtils]: 11: Hoare triple {2320#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {2321#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,946 INFO L280 TraceCheckUtils]: 12: Hoare triple {2321#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {2321#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,948 INFO L280 TraceCheckUtils]: 13: Hoare triple {2321#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {2322#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,949 INFO L280 TraceCheckUtils]: 14: Hoare triple {2322#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {2322#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,951 INFO L280 TraceCheckUtils]: 15: Hoare triple {2322#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {2323#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,952 INFO L280 TraceCheckUtils]: 16: Hoare triple {2323#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {2323#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {2323#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !(~a > ~b);~b := ~b - ~a; {2324#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 4 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,955 INFO L280 TraceCheckUtils]: 18: Hoare triple {2324#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 4 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume !!(0 != ~b); {2324#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 4 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,956 INFO L280 TraceCheckUtils]: 19: Hoare triple {2324#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 4 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume ~a > ~b;~a := ~a - ~b; {2325#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,957 INFO L280 TraceCheckUtils]: 20: Hoare triple {2325#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume !!(0 != ~b); {2325#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,959 INFO L280 TraceCheckUtils]: 21: Hoare triple {2325#(<= (+ (* 2 gcd_test_~a) (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume !(~a > ~b);~b := ~b - ~a; {2326#(<= (+ (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} is VALID [2020-07-10 14:42:59,960 INFO L280 TraceCheckUtils]: 22: Hoare triple {2326#(<= (+ (* 21 |gcd_test_#in~b|) 1) (+ (* 2 gcd_test_~b) (* 6 |gcd_test_#in~a|)))} assume !(0 != ~b); {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,960 INFO L280 TraceCheckUtils]: 23: Hoare triple {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} #res := ~a; {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,961 INFO L280 TraceCheckUtils]: 24: Hoare triple {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} assume true; {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} is VALID [2020-07-10 14:42:59,963 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2327#(<= (+ (* 7 |gcd_test_#in~b|) 1) (* 2 |gcd_test_#in~a|))} {2297#(<= (* 2 main_~x~0) (* 7 main_~y~0))} #65#return; {2294#false} is VALID [2020-07-10 14:42:59,963 INFO L280 TraceCheckUtils]: 26: Hoare triple {2294#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {2294#false} is VALID [2020-07-10 14:42:59,963 INFO L263 TraceCheckUtils]: 27: Hoare triple {2294#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {2294#false} is VALID [2020-07-10 14:42:59,964 INFO L280 TraceCheckUtils]: 28: Hoare triple {2294#false} ~cond := #in~cond; {2294#false} is VALID [2020-07-10 14:42:59,964 INFO L280 TraceCheckUtils]: 29: Hoare triple {2294#false} assume 0 == ~cond; {2294#false} is VALID [2020-07-10 14:42:59,964 INFO L280 TraceCheckUtils]: 30: Hoare triple {2294#false} assume !false; {2294#false} is VALID [2020-07-10 14:42:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:42:59,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640160631] [2020-07-10 14:42:59,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662838188] [2020-07-10 14:42:59,970 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:43:00,009 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-07-10 14:43:00,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:43:00,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-10 14:43:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:43:00,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:43:13,050 INFO L263 TraceCheckUtils]: 0: Hoare triple {2293#true} call ULTIMATE.init(); {2293#true} is VALID [2020-07-10 14:43:13,050 INFO L280 TraceCheckUtils]: 1: Hoare triple {2293#true} assume true; {2293#true} is VALID [2020-07-10 14:43:13,051 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2293#true} {2293#true} #61#return; {2293#true} is VALID [2020-07-10 14:43:13,051 INFO L263 TraceCheckUtils]: 3: Hoare triple {2293#true} call #t~ret1 := main(); {2293#true} is VALID [2020-07-10 14:43:13,053 INFO L280 TraceCheckUtils]: 4: Hoare triple {2293#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {2343#(and (<= main_~x~0 63) (<= 18 main_~y~0))} is VALID [2020-07-10 14:43:13,053 INFO L263 TraceCheckUtils]: 5: Hoare triple {2343#(and (<= main_~x~0 63) (<= 18 main_~y~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {2293#true} is VALID [2020-07-10 14:43:13,054 INFO L280 TraceCheckUtils]: 6: Hoare triple {2293#true} ~a := #in~a;~b := #in~b; {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,054 INFO L280 TraceCheckUtils]: 7: Hoare triple {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !(~a < 0); {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,055 INFO L280 TraceCheckUtils]: 8: Hoare triple {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !(~b < 0); {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !(0 == ~a); {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,056 INFO L280 TraceCheckUtils]: 10: Hoare triple {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !!(0 != ~b); {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,057 INFO L280 TraceCheckUtils]: 11: Hoare triple {2350#(and (<= gcd_test_~a |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume ~a > ~b;~a := ~a - ~b; {2366#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,060 INFO L280 TraceCheckUtils]: 12: Hoare triple {2366#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !!(0 != ~b); {2366#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,066 INFO L280 TraceCheckUtils]: 13: Hoare triple {2366#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume ~a > ~b;~a := ~a - ~b; {2373#(and (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,067 INFO L280 TraceCheckUtils]: 14: Hoare triple {2373#(and (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !!(0 != ~b); {2373#(and (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,068 INFO L280 TraceCheckUtils]: 15: Hoare triple {2373#(and (<= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume ~a > ~b;~a := ~a - ~b; {2380#(and (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,069 INFO L280 TraceCheckUtils]: 16: Hoare triple {2380#(and (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !!(0 != ~b); {2380#(and (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} is VALID [2020-07-10 14:43:13,071 INFO L280 TraceCheckUtils]: 17: Hoare triple {2380#(and (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b))} assume !(~a > ~b);~b := ~b - ~a; {2387#(and (<= |gcd_test_#in~b| (+ gcd_test_~b gcd_test_~a)) (<= |gcd_test_#in~b| (div (+ (* gcd_test_~a (- 1)) |gcd_test_#in~a|) 3)))} is VALID [2020-07-10 14:43:13,072 INFO L280 TraceCheckUtils]: 18: Hoare triple {2387#(and (<= |gcd_test_#in~b| (+ gcd_test_~b gcd_test_~a)) (<= |gcd_test_#in~b| (div (+ (* gcd_test_~a (- 1)) |gcd_test_#in~a|) 3)))} assume !!(0 != ~b); {2387#(and (<= |gcd_test_#in~b| (+ gcd_test_~b gcd_test_~a)) (<= |gcd_test_#in~b| (div (+ (* gcd_test_~a (- 1)) |gcd_test_#in~a|) 3)))} is VALID [2020-07-10 14:43:13,075 INFO L280 TraceCheckUtils]: 19: Hoare triple {2387#(and (<= |gcd_test_#in~b| (+ gcd_test_~b gcd_test_~a)) (<= |gcd_test_#in~b| (div (+ (* gcd_test_~a (- 1)) |gcd_test_#in~a|) 3)))} assume ~a > ~b;~a := ~a - ~b; {2394#(exists ((v_gcd_test_~a_23 Int)) (and (<= (+ gcd_test_~b gcd_test_~a) v_gcd_test_~a_23) (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= |gcd_test_#in~b| (+ v_gcd_test_~a_23 gcd_test_~b))))} is VALID [2020-07-10 14:43:13,076 INFO L280 TraceCheckUtils]: 20: Hoare triple {2394#(exists ((v_gcd_test_~a_23 Int)) (and (<= (+ gcd_test_~b gcd_test_~a) v_gcd_test_~a_23) (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= |gcd_test_#in~b| (+ v_gcd_test_~a_23 gcd_test_~b))))} assume !!(0 != ~b); {2394#(exists ((v_gcd_test_~a_23 Int)) (and (<= (+ gcd_test_~b gcd_test_~a) v_gcd_test_~a_23) (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= |gcd_test_#in~b| (+ v_gcd_test_~a_23 gcd_test_~b))))} is VALID [2020-07-10 14:43:13,079 INFO L280 TraceCheckUtils]: 21: Hoare triple {2394#(exists ((v_gcd_test_~a_23 Int)) (and (<= (+ gcd_test_~b gcd_test_~a) v_gcd_test_~a_23) (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= |gcd_test_#in~b| (+ v_gcd_test_~a_23 gcd_test_~b))))} assume !(~a > ~b);~b := ~b - ~a; {2401#(exists ((v_gcd_test_~a_23 Int)) (and (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= (* 2 |gcd_test_#in~b|) (+ (* 3 v_gcd_test_~a_23) gcd_test_~b))))} is VALID [2020-07-10 14:43:13,080 INFO L280 TraceCheckUtils]: 22: Hoare triple {2401#(exists ((v_gcd_test_~a_23 Int)) (and (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= (* 2 |gcd_test_#in~b|) (+ (* 3 v_gcd_test_~a_23) gcd_test_~b))))} assume !(0 != ~b); {2405#(exists ((v_gcd_test_~a_23 Int)) (and (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= (* 2 |gcd_test_#in~b|) (* 3 v_gcd_test_~a_23))))} is VALID [2020-07-10 14:43:13,080 INFO L280 TraceCheckUtils]: 23: Hoare triple {2405#(exists ((v_gcd_test_~a_23 Int)) (and (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= (* 2 |gcd_test_#in~b|) (* 3 v_gcd_test_~a_23))))} #res := ~a; {2405#(exists ((v_gcd_test_~a_23 Int)) (and (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= (* 2 |gcd_test_#in~b|) (* 3 v_gcd_test_~a_23))))} is VALID [2020-07-10 14:43:13,081 INFO L280 TraceCheckUtils]: 24: Hoare triple {2405#(exists ((v_gcd_test_~a_23 Int)) (and (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= (* 2 |gcd_test_#in~b|) (* 3 v_gcd_test_~a_23))))} assume true; {2405#(exists ((v_gcd_test_~a_23 Int)) (and (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= (* 2 |gcd_test_#in~b|) (* 3 v_gcd_test_~a_23))))} is VALID [2020-07-10 14:43:13,083 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2405#(exists ((v_gcd_test_~a_23 Int)) (and (<= |gcd_test_#in~b| (div (+ (* v_gcd_test_~a_23 (- 1)) |gcd_test_#in~a|) 3)) (<= (* 2 |gcd_test_#in~b|) (* 3 v_gcd_test_~a_23))))} {2343#(and (<= main_~x~0 63) (<= 18 main_~y~0))} #65#return; {2294#false} is VALID [2020-07-10 14:43:13,083 INFO L280 TraceCheckUtils]: 26: Hoare triple {2294#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {2294#false} is VALID [2020-07-10 14:43:13,083 INFO L263 TraceCheckUtils]: 27: Hoare triple {2294#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {2294#false} is VALID [2020-07-10 14:43:13,083 INFO L280 TraceCheckUtils]: 28: Hoare triple {2294#false} ~cond := #in~cond; {2294#false} is VALID [2020-07-10 14:43:13,083 INFO L280 TraceCheckUtils]: 29: Hoare triple {2294#false} assume 0 == ~cond; {2294#false} is VALID [2020-07-10 14:43:13,084 INFO L280 TraceCheckUtils]: 30: Hoare triple {2294#false} assume !false; {2294#false} is VALID [2020-07-10 14:43:13,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:43:13,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:43:13,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2020-07-10 14:43:13,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911627186] [2020-07-10 14:43:13,088 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2020-07-10 14:43:13,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:43:13,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-10 14:43:13,207 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-10 14:43:13,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-10 14:43:13,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:43:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-10 14:43:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=396, Unknown=6, NotChecked=0, Total=462 [2020-07-10 14:43:13,209 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 22 states. [2020-07-10 14:44:19,616 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 42 [2020-07-10 14:44:38,565 WARN L193 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-10 14:44:47,051 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 40 [2020-07-10 14:44:56,598 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-10 14:45:11,554 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-10 14:45:50,947 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 32 [2020-07-10 14:46:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:46:21,778 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2020-07-10 14:46:21,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 14:46:21,779 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2020-07-10 14:46:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:46:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 14:46:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2020-07-10 14:46:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 14:46:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2020-07-10 14:46:21,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2020-07-10 14:46:22,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:46:22,666 INFO L225 Difference]: With dead ends: 79 [2020-07-10 14:46:22,666 INFO L226 Difference]: Without dead ends: 46 [2020-07-10 14:46:22,668 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 57.1s TimeCoverageRelationStatistics Valid=135, Invalid=775, Unknown=20, NotChecked=0, Total=930 [2020-07-10 14:46:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-10 14:46:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-10 14:46:22,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:46:22,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2020-07-10 14:46:22,913 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-10 14:46:22,913 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-10 14:46:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:46:22,916 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-10 14:46:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-10 14:46:22,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:46:22,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:46:22,917 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-10 14:46:22,917 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-10 14:46:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:46:22,919 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-10 14:46:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-10 14:46:22,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:46:22,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:46:22,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:46:22,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:46:22,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-10 14:46:22,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-10 14:46:22,922 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2020-07-10 14:46:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:46:22,922 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-10 14:46:22,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-10 14:46:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-10 14:46:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 14:46:22,923 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:46:22,923 INFO L422 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:46:23,123 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:46:23,124 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:46:23,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:46:23,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1492674782, now seen corresponding path program 6 times [2020-07-10 14:46:23,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:46:23,126 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969693722] [2020-07-10 14:46:23,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:46:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:23,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {2715#true} assume true; {2715#true} is VALID [2020-07-10 14:46:23,173 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2715#true} {2715#true} #61#return; {2715#true} is VALID [2020-07-10 14:46:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:23,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {2715#true} ~a := #in~a;~b := #in~b; {2715#true} is VALID [2020-07-10 14:46:23,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {2715#true} assume !(~a < 0); {2715#true} is VALID [2020-07-10 14:46:23,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {2715#true} assume !(~b < 0); {2715#true} is VALID [2020-07-10 14:46:23,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {2715#true} assume !(0 == ~a); {2715#true} is VALID [2020-07-10 14:46:23,264 INFO L280 TraceCheckUtils]: 4: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,264 INFO L280 TraceCheckUtils]: 5: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-10 14:46:23,264 INFO L280 TraceCheckUtils]: 6: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,264 INFO L280 TraceCheckUtils]: 7: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-10 14:46:23,265 INFO L280 TraceCheckUtils]: 8: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,265 INFO L280 TraceCheckUtils]: 9: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-10 14:46:23,265 INFO L280 TraceCheckUtils]: 10: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,265 INFO L280 TraceCheckUtils]: 11: Hoare triple {2715#true} assume !(~a > ~b);~b := ~b - ~a; {2715#true} is VALID [2020-07-10 14:46:23,265 INFO L280 TraceCheckUtils]: 12: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,266 INFO L280 TraceCheckUtils]: 13: Hoare triple {2715#true} assume !(~a > ~b);~b := ~b - ~a; {2715#true} is VALID [2020-07-10 14:46:23,268 INFO L280 TraceCheckUtils]: 14: Hoare triple {2715#true} assume !!(0 != ~b); {2739#(not (= gcd_test_~b 0))} is VALID [2020-07-10 14:46:23,271 INFO L280 TraceCheckUtils]: 15: Hoare triple {2739#(not (= gcd_test_~b 0))} assume ~a > ~b;~a := ~a - ~b; {2739#(not (= gcd_test_~b 0))} is VALID [2020-07-10 14:46:23,275 INFO L280 TraceCheckUtils]: 16: Hoare triple {2739#(not (= gcd_test_~b 0))} assume !(0 != ~b); {2716#false} is VALID [2020-07-10 14:46:23,275 INFO L280 TraceCheckUtils]: 17: Hoare triple {2716#false} #res := ~a; {2716#false} is VALID [2020-07-10 14:46:23,275 INFO L280 TraceCheckUtils]: 18: Hoare triple {2716#false} assume true; {2716#false} is VALID [2020-07-10 14:46:23,276 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2716#false} {2715#true} #65#return; {2716#false} is VALID [2020-07-10 14:46:23,276 INFO L263 TraceCheckUtils]: 0: Hoare triple {2715#true} call ULTIMATE.init(); {2715#true} is VALID [2020-07-10 14:46:23,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {2715#true} assume true; {2715#true} is VALID [2020-07-10 14:46:23,277 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2715#true} {2715#true} #61#return; {2715#true} is VALID [2020-07-10 14:46:23,277 INFO L263 TraceCheckUtils]: 3: Hoare triple {2715#true} call #t~ret1 := main(); {2715#true} is VALID [2020-07-10 14:46:23,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {2715#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {2715#true} is VALID [2020-07-10 14:46:23,277 INFO L263 TraceCheckUtils]: 5: Hoare triple {2715#true} call #t~ret0 := gcd_test(~x~0, ~y~0); {2715#true} is VALID [2020-07-10 14:46:23,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {2715#true} ~a := #in~a;~b := #in~b; {2715#true} is VALID [2020-07-10 14:46:23,277 INFO L280 TraceCheckUtils]: 7: Hoare triple {2715#true} assume !(~a < 0); {2715#true} is VALID [2020-07-10 14:46:23,277 INFO L280 TraceCheckUtils]: 8: Hoare triple {2715#true} assume !(~b < 0); {2715#true} is VALID [2020-07-10 14:46:23,278 INFO L280 TraceCheckUtils]: 9: Hoare triple {2715#true} assume !(0 == ~a); {2715#true} is VALID [2020-07-10 14:46:23,278 INFO L280 TraceCheckUtils]: 10: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-10 14:46:23,278 INFO L280 TraceCheckUtils]: 12: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,278 INFO L280 TraceCheckUtils]: 13: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-10 14:46:23,278 INFO L280 TraceCheckUtils]: 14: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,278 INFO L280 TraceCheckUtils]: 15: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-10 14:46:23,278 INFO L280 TraceCheckUtils]: 16: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,279 INFO L280 TraceCheckUtils]: 17: Hoare triple {2715#true} assume !(~a > ~b);~b := ~b - ~a; {2715#true} is VALID [2020-07-10 14:46:23,279 INFO L280 TraceCheckUtils]: 18: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-10 14:46:23,279 INFO L280 TraceCheckUtils]: 19: Hoare triple {2715#true} assume !(~a > ~b);~b := ~b - ~a; {2715#true} is VALID [2020-07-10 14:46:23,281 INFO L280 TraceCheckUtils]: 20: Hoare triple {2715#true} assume !!(0 != ~b); {2739#(not (= gcd_test_~b 0))} is VALID [2020-07-10 14:46:23,284 INFO L280 TraceCheckUtils]: 21: Hoare triple {2739#(not (= gcd_test_~b 0))} assume ~a > ~b;~a := ~a - ~b; {2739#(not (= gcd_test_~b 0))} is VALID [2020-07-10 14:46:23,287 INFO L280 TraceCheckUtils]: 22: Hoare triple {2739#(not (= gcd_test_~b 0))} assume !(0 != ~b); {2716#false} is VALID [2020-07-10 14:46:23,287 INFO L280 TraceCheckUtils]: 23: Hoare triple {2716#false} #res := ~a; {2716#false} is VALID [2020-07-10 14:46:23,288 INFO L280 TraceCheckUtils]: 24: Hoare triple {2716#false} assume true; {2716#false} is VALID [2020-07-10 14:46:23,288 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2716#false} {2715#true} #65#return; {2716#false} is VALID [2020-07-10 14:46:23,288 INFO L280 TraceCheckUtils]: 26: Hoare triple {2716#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {2716#false} is VALID [2020-07-10 14:46:23,288 INFO L263 TraceCheckUtils]: 27: Hoare triple {2716#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {2716#false} is VALID [2020-07-10 14:46:23,288 INFO L280 TraceCheckUtils]: 28: Hoare triple {2716#false} ~cond := #in~cond; {2716#false} is VALID [2020-07-10 14:46:23,289 INFO L280 TraceCheckUtils]: 29: Hoare triple {2716#false} assume 0 == ~cond; {2716#false} is VALID [2020-07-10 14:46:23,289 INFO L280 TraceCheckUtils]: 30: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2020-07-10 14:46:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-07-10 14:46:23,290 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969693722] [2020-07-10 14:46:23,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:46:23,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 14:46:23,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602002366] [2020-07-10 14:46:23,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 14:46:23,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:46:23,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 14:46:23,478 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-10 14:46:23,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 14:46:23,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:46:23,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 14:46:23,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 14:46:23,479 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 3 states. [2020-07-10 14:46:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:46:23,979 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-07-10 14:46:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 14:46:23,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-10 14:46:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:46:23,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 14:46:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2020-07-10 14:46:23,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 14:46:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2020-07-10 14:46:23,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2020-07-10 14:46:24,323 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-10 14:46:24,324 INFO L225 Difference]: With dead ends: 60 [2020-07-10 14:46:24,325 INFO L226 Difference]: Without dead ends: 47 [2020-07-10 14:46:24,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 14:46:24,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-10 14:46:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-10 14:46:24,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:46:24,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-10 14:46:24,578 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-10 14:46:24,578 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-10 14:46:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:46:24,580 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-10 14:46:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-10 14:46:24,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:46:24,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:46:24,581 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-10 14:46:24,582 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-10 14:46:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:46:24,583 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-10 14:46:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-10 14:46:24,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:46:24,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:46:24,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:46:24,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:46:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 14:46:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-10 14:46:24,586 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 31 [2020-07-10 14:46:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:46:24,586 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-10 14:46:24,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 14:46:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-10 14:46:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 14:46:24,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:46:24,587 INFO L422 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:46:24,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 14:46:24,587 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:46:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:46:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1099647772, now seen corresponding path program 7 times [2020-07-10 14:46:24,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:46:24,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562051218] [2020-07-10 14:46:24,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:46:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:24,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {2989#true} assume true; {2989#true} is VALID [2020-07-10 14:46:24,684 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2989#true} {2989#true} #61#return; {2989#true} is VALID [2020-07-10 14:46:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:25,310 INFO L280 TraceCheckUtils]: 0: Hoare triple {2989#true} ~a := #in~a;~b := #in~b; {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~a < 0); {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~b < 0); {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,318 INFO L280 TraceCheckUtils]: 3: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(0 == ~a); {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,321 INFO L280 TraceCheckUtils]: 4: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !!(0 != ~b); {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,324 INFO L280 TraceCheckUtils]: 5: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {3015#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:25,327 INFO L280 TraceCheckUtils]: 6: Hoare triple {3015#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume !!(0 != ~b); {3015#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:25,331 INFO L280 TraceCheckUtils]: 7: Hoare triple {3015#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3016#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:25,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {3016#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3016#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:25,338 INFO L280 TraceCheckUtils]: 9: Hoare triple {3016#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3017#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:25,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {3017#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3017#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:25,345 INFO L280 TraceCheckUtils]: 11: Hoare triple {3017#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !(~a > ~b);~b := ~b - ~a; {3018#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ (* 2 gcd_test_~a) (* 10 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:25,347 INFO L280 TraceCheckUtils]: 12: Hoare triple {3018#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ (* 2 gcd_test_~a) (* 10 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3018#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ (* 2 gcd_test_~a) (* 10 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:25,351 INFO L280 TraceCheckUtils]: 13: Hoare triple {3018#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ (* 2 gcd_test_~a) (* 10 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3019#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ gcd_test_~a (* 10 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:25,354 INFO L280 TraceCheckUtils]: 14: Hoare triple {3019#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ gcd_test_~a (* 10 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3019#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ gcd_test_~a (* 10 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:25,357 INFO L280 TraceCheckUtils]: 15: Hoare triple {3019#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ gcd_test_~a (* 10 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:25,360 INFO L280 TraceCheckUtils]: 16: Hoare triple {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} assume !(0 != ~b); {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:25,363 INFO L280 TraceCheckUtils]: 17: Hoare triple {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} #res := ~a; {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:25,365 INFO L280 TraceCheckUtils]: 18: Hoare triple {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} assume true; {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:25,369 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} {2993#(<= (+ (* 10 main_~y~0) 9) (* 3 main_~x~0))} #65#return; {2990#false} is VALID [2020-07-10 14:46:25,370 INFO L263 TraceCheckUtils]: 0: Hoare triple {2989#true} call ULTIMATE.init(); {2989#true} is VALID [2020-07-10 14:46:25,370 INFO L280 TraceCheckUtils]: 1: Hoare triple {2989#true} assume true; {2989#true} is VALID [2020-07-10 14:46:25,371 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2989#true} {2989#true} #61#return; {2989#true} is VALID [2020-07-10 14:46:25,371 INFO L263 TraceCheckUtils]: 3: Hoare triple {2989#true} call #t~ret1 := main(); {2989#true} is VALID [2020-07-10 14:46:25,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {2989#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {2993#(<= (+ (* 10 main_~y~0) 9) (* 3 main_~x~0))} is VALID [2020-07-10 14:46:25,377 INFO L263 TraceCheckUtils]: 5: Hoare triple {2993#(<= (+ (* 10 main_~y~0) 9) (* 3 main_~x~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {2989#true} is VALID [2020-07-10 14:46:25,379 INFO L280 TraceCheckUtils]: 6: Hoare triple {2989#true} ~a := #in~a;~b := #in~b; {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,382 INFO L280 TraceCheckUtils]: 7: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~a < 0); {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,385 INFO L280 TraceCheckUtils]: 8: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~b < 0); {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,388 INFO L280 TraceCheckUtils]: 9: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(0 == ~a); {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,390 INFO L280 TraceCheckUtils]: 10: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !!(0 != ~b); {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:25,393 INFO L280 TraceCheckUtils]: 11: Hoare triple {3014#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {3015#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:25,396 INFO L280 TraceCheckUtils]: 12: Hoare triple {3015#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume !!(0 != ~b); {3015#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:25,400 INFO L280 TraceCheckUtils]: 13: Hoare triple {3015#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3016#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:25,403 INFO L280 TraceCheckUtils]: 14: Hoare triple {3016#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3016#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:25,407 INFO L280 TraceCheckUtils]: 15: Hoare triple {3016#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3017#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:25,410 INFO L280 TraceCheckUtils]: 16: Hoare triple {3017#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3017#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:25,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {3017#(and (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !(~a > ~b);~b := ~b - ~a; {3018#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ (* 2 gcd_test_~a) (* 10 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:25,417 INFO L280 TraceCheckUtils]: 18: Hoare triple {3018#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ (* 2 gcd_test_~a) (* 10 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3018#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ (* 2 gcd_test_~a) (* 10 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:25,421 INFO L280 TraceCheckUtils]: 19: Hoare triple {3018#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ (* 2 gcd_test_~a) (* 10 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3019#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ gcd_test_~a (* 10 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:25,424 INFO L280 TraceCheckUtils]: 20: Hoare triple {3019#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ gcd_test_~a (* 10 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3019#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ gcd_test_~a (* 10 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:25,427 INFO L280 TraceCheckUtils]: 21: Hoare triple {3019#(<= (+ gcd_test_~b (* 3 |gcd_test_#in~a|)) (+ gcd_test_~a (* 10 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:25,430 INFO L280 TraceCheckUtils]: 22: Hoare triple {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} assume !(0 != ~b); {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:25,433 INFO L280 TraceCheckUtils]: 23: Hoare triple {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} #res := ~a; {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:25,435 INFO L280 TraceCheckUtils]: 24: Hoare triple {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} assume true; {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:25,439 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3020#(<= (* 3 |gcd_test_#in~a|) (* 10 |gcd_test_#in~b|))} {2993#(<= (+ (* 10 main_~y~0) 9) (* 3 main_~x~0))} #65#return; {2990#false} is VALID [2020-07-10 14:46:25,439 INFO L280 TraceCheckUtils]: 26: Hoare triple {2990#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {2990#false} is VALID [2020-07-10 14:46:25,439 INFO L263 TraceCheckUtils]: 27: Hoare triple {2990#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {2990#false} is VALID [2020-07-10 14:46:25,440 INFO L280 TraceCheckUtils]: 28: Hoare triple {2990#false} ~cond := #in~cond; {2990#false} is VALID [2020-07-10 14:46:25,440 INFO L280 TraceCheckUtils]: 29: Hoare triple {2990#false} assume 0 == ~cond; {2990#false} is VALID [2020-07-10 14:46:25,440 INFO L280 TraceCheckUtils]: 30: Hoare triple {2990#false} assume !false; {2990#false} is VALID [2020-07-10 14:46:25,442 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:46:25,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562051218] [2020-07-10 14:46:25,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273640386] [2020-07-10 14:46:25,443 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:46:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:25,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-10 14:46:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:25,481 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:46:30,772 INFO L263 TraceCheckUtils]: 0: Hoare triple {2989#true} call ULTIMATE.init(); {2989#true} is VALID [2020-07-10 14:46:30,772 INFO L280 TraceCheckUtils]: 1: Hoare triple {2989#true} assume true; {2989#true} is VALID [2020-07-10 14:46:30,772 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2989#true} {2989#true} #61#return; {2989#true} is VALID [2020-07-10 14:46:30,772 INFO L263 TraceCheckUtils]: 3: Hoare triple {2989#true} call #t~ret1 := main(); {2989#true} is VALID [2020-07-10 14:46:30,775 INFO L280 TraceCheckUtils]: 4: Hoare triple {2989#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {3036#(and (<= main_~y~0 18) (<= 63 main_~x~0))} is VALID [2020-07-10 14:46:30,775 INFO L263 TraceCheckUtils]: 5: Hoare triple {3036#(and (<= main_~y~0 18) (<= 63 main_~x~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {2989#true} is VALID [2020-07-10 14:46:30,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {2989#true} ~a := #in~a;~b := #in~b; {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:30,781 INFO L280 TraceCheckUtils]: 7: Hoare triple {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~a < 0); {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:30,783 INFO L280 TraceCheckUtils]: 8: Hoare triple {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~b < 0); {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:30,786 INFO L280 TraceCheckUtils]: 9: Hoare triple {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(0 == ~a); {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:30,789 INFO L280 TraceCheckUtils]: 10: Hoare triple {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !!(0 != ~b); {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:30,793 INFO L280 TraceCheckUtils]: 11: Hoare triple {3043#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume ~a > ~b;~a := ~a - ~b; {3059#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:30,796 INFO L280 TraceCheckUtils]: 12: Hoare triple {3059#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume !!(0 != ~b); {3059#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:30,800 INFO L280 TraceCheckUtils]: 13: Hoare triple {3059#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3066#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:30,803 INFO L280 TraceCheckUtils]: 14: Hoare triple {3066#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3066#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:30,807 INFO L280 TraceCheckUtils]: 15: Hoare triple {3066#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3073#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:30,810 INFO L280 TraceCheckUtils]: 16: Hoare triple {3073#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3073#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:30,818 INFO L280 TraceCheckUtils]: 17: Hoare triple {3073#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !(~a > ~b);~b := ~b - ~a; {3080#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:30,820 INFO L280 TraceCheckUtils]: 18: Hoare triple {3080#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} assume !!(0 != ~b); {3080#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:30,827 INFO L280 TraceCheckUtils]: 19: Hoare triple {3080#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} assume !(~a > ~b);~b := ~b - ~a; {3087#(and (<= (+ gcd_test_~b (* 2 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:30,830 INFO L280 TraceCheckUtils]: 20: Hoare triple {3087#(and (<= (+ gcd_test_~b (* 2 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} assume !!(0 != ~b); {3087#(and (<= (+ gcd_test_~b (* 2 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:30,840 INFO L280 TraceCheckUtils]: 21: Hoare triple {3087#(and (<= (+ gcd_test_~b (* 2 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} assume !(~a > ~b);~b := ~b - ~a; {3094#(exists ((gcd_test_~a Int)) (and (<= (+ gcd_test_~b (* 3 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:30,843 INFO L280 TraceCheckUtils]: 22: Hoare triple {3094#(exists ((gcd_test_~a Int)) (and (<= (+ gcd_test_~b (* 3 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)))} assume !(0 != ~b); {3098#(exists ((gcd_test_~a Int)) (and (<= (* 3 gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:30,846 INFO L280 TraceCheckUtils]: 23: Hoare triple {3098#(exists ((gcd_test_~a Int)) (and (<= (* 3 gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)))} #res := ~a; {3098#(exists ((gcd_test_~a Int)) (and (<= (* 3 gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:30,849 INFO L280 TraceCheckUtils]: 24: Hoare triple {3098#(exists ((gcd_test_~a Int)) (and (<= (* 3 gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)))} assume true; {3098#(exists ((gcd_test_~a Int)) (and (<= (* 3 gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:30,855 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {3098#(exists ((gcd_test_~a Int)) (and (<= (* 3 gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)))} {3036#(and (<= main_~y~0 18) (<= 63 main_~x~0))} #65#return; {2990#false} is VALID [2020-07-10 14:46:30,855 INFO L280 TraceCheckUtils]: 26: Hoare triple {2990#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {2990#false} is VALID [2020-07-10 14:46:30,855 INFO L263 TraceCheckUtils]: 27: Hoare triple {2990#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {2990#false} is VALID [2020-07-10 14:46:30,855 INFO L280 TraceCheckUtils]: 28: Hoare triple {2990#false} ~cond := #in~cond; {2990#false} is VALID [2020-07-10 14:46:30,855 INFO L280 TraceCheckUtils]: 29: Hoare triple {2990#false} assume 0 == ~cond; {2990#false} is VALID [2020-07-10 14:46:30,855 INFO L280 TraceCheckUtils]: 30: Hoare triple {2990#false} assume !false; {2990#false} is VALID [2020-07-10 14:46:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:46:30,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:46:30,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2020-07-10 14:46:30,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045683292] [2020-07-10 14:46:30,858 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-07-10 14:46:30,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:46:30,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 14:46:31,294 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-10 14:46:31,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 14:46:31,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:46:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 14:46:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=298, Unknown=1, NotChecked=0, Total=342 [2020-07-10 14:46:31,296 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 19 states. [2020-07-10 14:46:36,479 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2020-07-10 14:46:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:46:45,433 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2020-07-10 14:46:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 14:46:45,433 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-07-10 14:46:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:46:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 14:46:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2020-07-10 14:46:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 14:46:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2020-07-10 14:46:45,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 77 transitions. [2020-07-10 14:46:46,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:46:46,270 INFO L225 Difference]: With dead ends: 73 [2020-07-10 14:46:46,270 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 14:46:46,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=98, Invalid=551, Unknown=1, NotChecked=0, Total=650 [2020-07-10 14:46:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 14:46:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-10 14:46:46,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:46:46,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-10 14:46:46,553 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-10 14:46:46,553 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-10 14:46:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:46:46,554 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-10 14:46:46,554 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-10 14:46:46,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:46:46,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:46:46,555 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-10 14:46:46,555 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-10 14:46:46,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:46:46,561 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-10 14:46:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-10 14:46:46,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:46:46,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:46:46,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:46:46,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:46:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-10 14:46:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-10 14:46:46,566 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 31 [2020-07-10 14:46:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:46:46,567 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-10 14:46:46,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 14:46:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-10 14:46:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-10 14:46:46,568 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:46:46,568 INFO L422 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:46:46,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:46:46,782 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:46:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:46:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash -202245895, now seen corresponding path program 8 times [2020-07-10 14:46:46,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:46:46,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456106260] [2020-07-10 14:46:46,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:46:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:46,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {3404#true} assume true; {3404#true} is VALID [2020-07-10 14:46:46,916 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3404#true} {3404#true} #61#return; {3404#true} is VALID [2020-07-10 14:46:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:48,020 INFO L280 TraceCheckUtils]: 0: Hoare triple {3404#true} ~a := #in~a;~b := #in~b; {3431#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:48,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {3431#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~a < 0); {3431#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:48,025 INFO L280 TraceCheckUtils]: 2: Hoare triple {3431#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~b < 0); {3432#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} is VALID [2020-07-10 14:46:48,028 INFO L280 TraceCheckUtils]: 3: Hoare triple {3432#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} assume !(0 == ~a); {3432#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} is VALID [2020-07-10 14:46:48,031 INFO L280 TraceCheckUtils]: 4: Hoare triple {3432#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} assume !!(0 != ~b); {3433#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:48,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {3433#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {3434#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:48,037 INFO L280 TraceCheckUtils]: 6: Hoare triple {3434#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume !!(0 != ~b); {3434#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:48,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {3434#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3435#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:48,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {3435#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3435#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:48,056 INFO L280 TraceCheckUtils]: 9: Hoare triple {3435#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3436#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:48,059 INFO L280 TraceCheckUtils]: 10: Hoare triple {3436#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3436#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:48,063 INFO L280 TraceCheckUtils]: 11: Hoare triple {3436#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !(~a > ~b);~b := ~b - ~a; {3437#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 6 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,066 INFO L280 TraceCheckUtils]: 12: Hoare triple {3437#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 6 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3437#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 6 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,070 INFO L280 TraceCheckUtils]: 13: Hoare triple {3437#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 6 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3438#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,073 INFO L280 TraceCheckUtils]: 14: Hoare triple {3438#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3438#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,077 INFO L280 TraceCheckUtils]: 15: Hoare triple {3438#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume ~a > ~b;~a := ~a - ~b; {3439#(<= (+ (* 2 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,080 INFO L280 TraceCheckUtils]: 16: Hoare triple {3439#(<= (+ (* 2 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3439#(<= (+ (* 2 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,084 INFO L280 TraceCheckUtils]: 17: Hoare triple {3439#(<= (+ (* 2 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:48,087 INFO L280 TraceCheckUtils]: 18: Hoare triple {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} assume !(0 != ~b); {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:48,090 INFO L280 TraceCheckUtils]: 19: Hoare triple {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} #res := ~a; {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:48,093 INFO L280 TraceCheckUtils]: 20: Hoare triple {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} assume true; {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:48,096 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} {3408#(and (<= (* 2 main_~x~0) (* 7 main_~y~0)) (<= (* 7 main_~y~0) (* 2 main_~x~0)))} #65#return; {3405#false} is VALID [2020-07-10 14:46:48,098 INFO L263 TraceCheckUtils]: 0: Hoare triple {3404#true} call ULTIMATE.init(); {3404#true} is VALID [2020-07-10 14:46:48,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {3404#true} assume true; {3404#true} is VALID [2020-07-10 14:46:48,098 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3404#true} {3404#true} #61#return; {3404#true} is VALID [2020-07-10 14:46:48,098 INFO L263 TraceCheckUtils]: 3: Hoare triple {3404#true} call #t~ret1 := main(); {3404#true} is VALID [2020-07-10 14:46:48,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {3404#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {3408#(and (<= (* 2 main_~x~0) (* 7 main_~y~0)) (<= (* 7 main_~y~0) (* 2 main_~x~0)))} is VALID [2020-07-10 14:46:48,102 INFO L263 TraceCheckUtils]: 5: Hoare triple {3408#(and (<= (* 2 main_~x~0) (* 7 main_~y~0)) (<= (* 7 main_~y~0) (* 2 main_~x~0)))} call #t~ret0 := gcd_test(~x~0, ~y~0); {3404#true} is VALID [2020-07-10 14:46:48,104 INFO L280 TraceCheckUtils]: 6: Hoare triple {3404#true} ~a := #in~a;~b := #in~b; {3431#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:48,107 INFO L280 TraceCheckUtils]: 7: Hoare triple {3431#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~a < 0); {3431#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:48,110 INFO L280 TraceCheckUtils]: 8: Hoare triple {3431#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~b < 0); {3432#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} is VALID [2020-07-10 14:46:48,113 INFO L280 TraceCheckUtils]: 9: Hoare triple {3432#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} assume !(0 == ~a); {3432#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} is VALID [2020-07-10 14:46:48,117 INFO L280 TraceCheckUtils]: 10: Hoare triple {3432#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|) (< 0 (+ gcd_test_~b 1)))} assume !!(0 != ~b); {3433#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:46:48,120 INFO L280 TraceCheckUtils]: 11: Hoare triple {3433#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {3434#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:48,123 INFO L280 TraceCheckUtils]: 12: Hoare triple {3434#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume !!(0 != ~b); {3434#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:48,127 INFO L280 TraceCheckUtils]: 13: Hoare triple {3434#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3435#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:48,131 INFO L280 TraceCheckUtils]: 14: Hoare triple {3435#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3435#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:48,135 INFO L280 TraceCheckUtils]: 15: Hoare triple {3435#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3436#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:48,138 INFO L280 TraceCheckUtils]: 16: Hoare triple {3436#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3436#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:48,148 INFO L280 TraceCheckUtils]: 17: Hoare triple {3436#(and (< 0 gcd_test_~b) (= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !(~a > ~b);~b := ~b - ~a; {3437#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 6 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,152 INFO L280 TraceCheckUtils]: 18: Hoare triple {3437#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 6 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3437#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 6 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,157 INFO L280 TraceCheckUtils]: 19: Hoare triple {3437#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 6 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3438#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,160 INFO L280 TraceCheckUtils]: 20: Hoare triple {3438#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3438#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,165 INFO L280 TraceCheckUtils]: 21: Hoare triple {3438#(<= (+ (* 4 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume ~a > ~b;~a := ~a - ~b; {3439#(<= (+ (* 2 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,167 INFO L280 TraceCheckUtils]: 22: Hoare triple {3439#(<= (+ (* 2 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3439#(<= (+ (* 2 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:48,171 INFO L280 TraceCheckUtils]: 23: Hoare triple {3439#(<= (+ (* 2 gcd_test_~b) (* 10 |gcd_test_#in~a|) 1) (+ (* 2 gcd_test_~a) (* 35 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:48,174 INFO L280 TraceCheckUtils]: 24: Hoare triple {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} assume !(0 != ~b); {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:48,177 INFO L280 TraceCheckUtils]: 25: Hoare triple {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} #res := ~a; {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:48,180 INFO L280 TraceCheckUtils]: 26: Hoare triple {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} assume true; {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:48,183 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3440#(<= (+ (* 2 |gcd_test_#in~a|) 1) (* 7 |gcd_test_#in~b|))} {3408#(and (<= (* 2 main_~x~0) (* 7 main_~y~0)) (<= (* 7 main_~y~0) (* 2 main_~x~0)))} #65#return; {3405#false} is VALID [2020-07-10 14:46:48,184 INFO L280 TraceCheckUtils]: 28: Hoare triple {3405#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {3405#false} is VALID [2020-07-10 14:46:48,184 INFO L263 TraceCheckUtils]: 29: Hoare triple {3405#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {3405#false} is VALID [2020-07-10 14:46:48,184 INFO L280 TraceCheckUtils]: 30: Hoare triple {3405#false} ~cond := #in~cond; {3405#false} is VALID [2020-07-10 14:46:48,184 INFO L280 TraceCheckUtils]: 31: Hoare triple {3405#false} assume 0 == ~cond; {3405#false} is VALID [2020-07-10 14:46:48,184 INFO L280 TraceCheckUtils]: 32: Hoare triple {3405#false} assume !false; {3405#false} is VALID [2020-07-10 14:46:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:46:48,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456106260] [2020-07-10 14:46:48,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762541317] [2020-07-10 14:46:48,187 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:46:48,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:46:48,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:46:48,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 14:46:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:46:48,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:46:54,811 INFO L263 TraceCheckUtils]: 0: Hoare triple {3404#true} call ULTIMATE.init(); {3404#true} is VALID [2020-07-10 14:46:54,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {3404#true} assume true; {3404#true} is VALID [2020-07-10 14:46:54,811 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3404#true} {3404#true} #61#return; {3404#true} is VALID [2020-07-10 14:46:54,811 INFO L263 TraceCheckUtils]: 3: Hoare triple {3404#true} call #t~ret1 := main(); {3404#true} is VALID [2020-07-10 14:46:54,814 INFO L280 TraceCheckUtils]: 4: Hoare triple {3404#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {3456#(and (<= main_~y~0 18) (<= 63 main_~x~0))} is VALID [2020-07-10 14:46:54,815 INFO L263 TraceCheckUtils]: 5: Hoare triple {3456#(and (<= main_~y~0 18) (<= 63 main_~x~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {3404#true} is VALID [2020-07-10 14:46:54,817 INFO L280 TraceCheckUtils]: 6: Hoare triple {3404#true} ~a := #in~a;~b := #in~b; {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:54,820 INFO L280 TraceCheckUtils]: 7: Hoare triple {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~a < 0); {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:54,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(~b < 0); {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:54,826 INFO L280 TraceCheckUtils]: 9: Hoare triple {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !(0 == ~a); {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:54,829 INFO L280 TraceCheckUtils]: 10: Hoare triple {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume !!(0 != ~b); {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} is VALID [2020-07-10 14:46:54,834 INFO L280 TraceCheckUtils]: 11: Hoare triple {3463#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| gcd_test_~a))} assume ~a > ~b;~a := ~a - ~b; {3479#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:54,837 INFO L280 TraceCheckUtils]: 12: Hoare triple {3479#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume !!(0 != ~b); {3479#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} is VALID [2020-07-10 14:46:54,841 INFO L280 TraceCheckUtils]: 13: Hoare triple {3479#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ gcd_test_~b gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3486#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:54,844 INFO L280 TraceCheckUtils]: 14: Hoare triple {3486#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3486#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:54,849 INFO L280 TraceCheckUtils]: 15: Hoare triple {3486#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 2 gcd_test_~b) gcd_test_~a)))} assume ~a > ~b;~a := ~a - ~b; {3493#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:54,851 INFO L280 TraceCheckUtils]: 16: Hoare triple {3493#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !!(0 != ~b); {3493#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} is VALID [2020-07-10 14:46:54,861 INFO L280 TraceCheckUtils]: 17: Hoare triple {3493#(and (<= gcd_test_~b |gcd_test_#in~b|) (<= |gcd_test_#in~a| (+ (* 3 gcd_test_~b) gcd_test_~a)))} assume !(~a > ~b);~b := ~b - ~a; {3500#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:54,864 INFO L280 TraceCheckUtils]: 18: Hoare triple {3500#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} assume !!(0 != ~b); {3500#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:54,871 INFO L280 TraceCheckUtils]: 19: Hoare triple {3500#(and (<= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} assume !(~a > ~b);~b := ~b - ~a; {3507#(and (<= (+ gcd_test_~b (* 2 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:54,874 INFO L280 TraceCheckUtils]: 20: Hoare triple {3507#(and (<= (+ gcd_test_~b (* 2 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} assume !!(0 != ~b); {3507#(and (<= (+ gcd_test_~b (* 2 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} is VALID [2020-07-10 14:46:54,883 INFO L280 TraceCheckUtils]: 21: Hoare triple {3507#(and (<= (+ gcd_test_~b (* 2 gcd_test_~a)) |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|))} assume ~a > ~b;~a := ~a - ~b; {3514#(exists ((v_gcd_test_~a_30 Int)) (and (<= (+ gcd_test_~b (* 2 v_gcd_test_~a_30)) |gcd_test_#in~b|) (<= v_gcd_test_~a_30 (+ gcd_test_~b gcd_test_~a)) (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:54,886 INFO L280 TraceCheckUtils]: 22: Hoare triple {3514#(exists ((v_gcd_test_~a_30 Int)) (and (<= (+ gcd_test_~b (* 2 v_gcd_test_~a_30)) |gcd_test_#in~b|) (<= v_gcd_test_~a_30 (+ gcd_test_~b gcd_test_~a)) (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|)))} assume !!(0 != ~b); {3514#(exists ((v_gcd_test_~a_30 Int)) (and (<= (+ gcd_test_~b (* 2 v_gcd_test_~a_30)) |gcd_test_#in~b|) (<= v_gcd_test_~a_30 (+ gcd_test_~b gcd_test_~a)) (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:54,894 INFO L280 TraceCheckUtils]: 23: Hoare triple {3514#(exists ((v_gcd_test_~a_30 Int)) (and (<= (+ gcd_test_~b (* 2 v_gcd_test_~a_30)) |gcd_test_#in~b|) (<= v_gcd_test_~a_30 (+ gcd_test_~b gcd_test_~a)) (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3521#(exists ((v_gcd_test_~a_30 Int)) (and (<= (+ gcd_test_~b (* 5 v_gcd_test_~a_30)) (* 2 |gcd_test_#in~b|)) (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|)))} is VALID [2020-07-10 14:46:54,901 INFO L280 TraceCheckUtils]: 24: Hoare triple {3521#(exists ((v_gcd_test_~a_30 Int)) (and (<= (+ gcd_test_~b (* 5 v_gcd_test_~a_30)) (* 2 |gcd_test_#in~b|)) (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|)))} assume !(0 != ~b); {3525#(exists ((v_gcd_test_~a_30 Int)) (and (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|) (<= (* 5 v_gcd_test_~a_30) (* 2 |gcd_test_#in~b|))))} is VALID [2020-07-10 14:46:54,903 INFO L280 TraceCheckUtils]: 25: Hoare triple {3525#(exists ((v_gcd_test_~a_30 Int)) (and (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|) (<= (* 5 v_gcd_test_~a_30) (* 2 |gcd_test_#in~b|))))} #res := ~a; {3525#(exists ((v_gcd_test_~a_30 Int)) (and (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|) (<= (* 5 v_gcd_test_~a_30) (* 2 |gcd_test_#in~b|))))} is VALID [2020-07-10 14:46:54,906 INFO L280 TraceCheckUtils]: 26: Hoare triple {3525#(exists ((v_gcd_test_~a_30 Int)) (and (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|) (<= (* 5 v_gcd_test_~a_30) (* 2 |gcd_test_#in~b|))))} assume true; {3525#(exists ((v_gcd_test_~a_30 Int)) (and (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|) (<= (* 5 v_gcd_test_~a_30) (* 2 |gcd_test_#in~b|))))} is VALID [2020-07-10 14:46:54,913 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {3525#(exists ((v_gcd_test_~a_30 Int)) (and (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|) (<= (* 5 v_gcd_test_~a_30) (* 2 |gcd_test_#in~b|))))} {3456#(and (<= main_~y~0 18) (<= 63 main_~x~0))} #65#return; {3405#false} is VALID [2020-07-10 14:46:54,913 INFO L280 TraceCheckUtils]: 28: Hoare triple {3405#false} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {3405#false} is VALID [2020-07-10 14:46:54,913 INFO L263 TraceCheckUtils]: 29: Hoare triple {3405#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {3405#false} is VALID [2020-07-10 14:46:54,913 INFO L280 TraceCheckUtils]: 30: Hoare triple {3405#false} ~cond := #in~cond; {3405#false} is VALID [2020-07-10 14:46:54,913 INFO L280 TraceCheckUtils]: 31: Hoare triple {3405#false} assume 0 == ~cond; {3405#false} is VALID [2020-07-10 14:46:54,914 INFO L280 TraceCheckUtils]: 32: Hoare triple {3405#false} assume !false; {3405#false} is VALID [2020-07-10 14:46:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 14:46:54,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:46:54,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2020-07-10 14:46:54,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243900930] [2020-07-10 14:46:54,918 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2020-07-10 14:46:54,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:46:54,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-10 14:46:55,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:46:55,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-10 14:46:55,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:46:55,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-10 14:46:55,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=438, Unknown=1, NotChecked=0, Total=506 [2020-07-10 14:46:55,425 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 23 states. [2020-07-10 14:47:07,586 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-07-10 14:47:10,415 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-07-10 14:47:14,019 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-07-10 14:47:29,709 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-07-10 14:47:46,665 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-10 14:47:51,068 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-07-10 14:47:56,227 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-10 14:48:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:48:03,802 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2020-07-10 14:48:03,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-10 14:48:03,802 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2020-07-10 14:48:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:48:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 14:48:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 89 transitions. [2020-07-10 14:48:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 14:48:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 89 transitions. [2020-07-10 14:48:03,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 89 transitions. [2020-07-10 14:48:05,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:48:05,116 INFO L225 Difference]: With dead ends: 80 [2020-07-10 14:48:05,117 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 14:48:05,118 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=150, Invalid=1036, Unknown=4, NotChecked=0, Total=1190 [2020-07-10 14:48:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 14:48:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-10 14:48:05,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:48:05,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-10 14:48:05,431 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 14:48:05,431 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 14:48:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:48:05,433 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2020-07-10 14:48:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2020-07-10 14:48:05,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:48:05,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:48:05,433 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-10 14:48:05,433 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-10 14:48:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:48:05,434 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2020-07-10 14:48:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2020-07-10 14:48:05,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:48:05,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:48:05,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:48:05,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:48:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 14:48:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2020-07-10 14:48:05,437 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 33 [2020-07-10 14:48:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:48:05,437 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2020-07-10 14:48:05,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-10 14:48:05,437 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2020-07-10 14:48:05,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 14:48:05,438 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:48:05,438 INFO L422 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:48:05,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-10 14:48:05,649 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:48:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:48:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash -825201876, now seen corresponding path program 1 times [2020-07-10 14:48:05,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:48:05,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240140030] [2020-07-10 14:48:05,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:48:05,658 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 14:48:05,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578110201] [2020-07-10 14:48:05,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:48:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:48:05,694 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-10 14:48:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:48:05,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:48:07,557 INFO L263 TraceCheckUtils]: 0: Hoare triple {3805#true} call ULTIMATE.init(); {3805#true} is VALID [2020-07-10 14:48:07,557 INFO L280 TraceCheckUtils]: 1: Hoare triple {3805#true} assume true; {3805#true} is VALID [2020-07-10 14:48:07,557 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3805#true} {3805#true} #61#return; {3805#true} is VALID [2020-07-10 14:48:07,557 INFO L263 TraceCheckUtils]: 3: Hoare triple {3805#true} call #t~ret1 := main(); {3805#true} is VALID [2020-07-10 14:48:07,560 INFO L280 TraceCheckUtils]: 4: Hoare triple {3805#true} havoc ~x~0;havoc ~y~0;havoc ~g~0;~x~0 := 63;~y~0 := 18; {3822#(and (= 18 main_~y~0) (= 63 main_~x~0))} is VALID [2020-07-10 14:48:07,561 INFO L263 TraceCheckUtils]: 5: Hoare triple {3822#(and (= 18 main_~y~0) (= 63 main_~x~0))} call #t~ret0 := gcd_test(~x~0, ~y~0); {3805#true} is VALID [2020-07-10 14:48:07,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {3805#true} ~a := #in~a;~b := #in~b; {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:48:07,567 INFO L280 TraceCheckUtils]: 7: Hoare triple {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~a < 0); {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:48:07,571 INFO L280 TraceCheckUtils]: 8: Hoare triple {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(~b < 0); {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:48:07,574 INFO L280 TraceCheckUtils]: 9: Hoare triple {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !(0 == ~a); {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:48:07,577 INFO L280 TraceCheckUtils]: 10: Hoare triple {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume !!(0 != ~b); {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} is VALID [2020-07-10 14:48:07,580 INFO L280 TraceCheckUtils]: 11: Hoare triple {3829#(and (= gcd_test_~b |gcd_test_#in~b|) (= gcd_test_~a |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {3845#(and (= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (= gcd_test_~b |gcd_test_#in~b|))} is VALID [2020-07-10 14:48:07,584 INFO L280 TraceCheckUtils]: 12: Hoare triple {3845#(and (= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (= gcd_test_~b |gcd_test_#in~b|))} assume !!(0 != ~b); {3845#(and (= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (= gcd_test_~b |gcd_test_#in~b|))} is VALID [2020-07-10 14:48:07,589 INFO L280 TraceCheckUtils]: 13: Hoare triple {3845#(and (= (+ gcd_test_~b gcd_test_~a) |gcd_test_#in~a|) (= gcd_test_~b |gcd_test_#in~b|))} assume ~a > ~b;~a := ~a - ~b; {3852#(and (= gcd_test_~b |gcd_test_#in~b|) (= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:48:07,592 INFO L280 TraceCheckUtils]: 14: Hoare triple {3852#(and (= gcd_test_~b |gcd_test_#in~b|) (= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume !!(0 != ~b); {3852#(and (= gcd_test_~b |gcd_test_#in~b|) (= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} is VALID [2020-07-10 14:48:07,597 INFO L280 TraceCheckUtils]: 15: Hoare triple {3852#(and (= gcd_test_~b |gcd_test_#in~b|) (= (+ (* 2 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|))} assume ~a > ~b;~a := ~a - ~b; {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:48:07,601 INFO L280 TraceCheckUtils]: 16: Hoare triple {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:48:07,604 INFO L280 TraceCheckUtils]: 17: Hoare triple {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:48:07,607 INFO L280 TraceCheckUtils]: 18: Hoare triple {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} assume !!(0 != ~b); {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:48:07,610 INFO L280 TraceCheckUtils]: 19: Hoare triple {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} assume !(~a > ~b);~b := ~b - ~a; {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:48:07,613 INFO L280 TraceCheckUtils]: 20: Hoare triple {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} assume !(0 != ~b); {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:48:07,616 INFO L280 TraceCheckUtils]: 21: Hoare triple {3859#(= |gcd_test_#in~a| (+ gcd_test_~a (* 3 |gcd_test_#in~b|)))} #res := ~a; {3878#(= |gcd_test_#in~a| (+ |gcd_test_#res| (* 3 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:48:07,620 INFO L280 TraceCheckUtils]: 22: Hoare triple {3878#(= |gcd_test_#in~a| (+ |gcd_test_#res| (* 3 |gcd_test_#in~b|)))} assume true; {3878#(= |gcd_test_#in~a| (+ |gcd_test_#res| (* 3 |gcd_test_#in~b|)))} is VALID [2020-07-10 14:48:07,623 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {3878#(= |gcd_test_#in~a| (+ |gcd_test_#res| (* 3 |gcd_test_#in~b|)))} {3822#(and (= 18 main_~y~0) (= 63 main_~x~0))} #65#return; {3885#(and (= 18 main_~y~0) (= 63 (+ (* 3 main_~y~0) |main_#t~ret0|)))} is VALID [2020-07-10 14:48:07,627 INFO L280 TraceCheckUtils]: 24: Hoare triple {3885#(and (= 18 main_~y~0) (= 63 (+ (* 3 main_~y~0) |main_#t~ret0|)))} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~g~0 := #t~ret0;havoc #t~ret0; {3889#(and (= (+ main_~g~0 (* 3 main_~y~0)) 63) (= 18 main_~y~0))} is VALID [2020-07-10 14:48:07,627 INFO L263 TraceCheckUtils]: 25: Hoare triple {3889#(and (= (+ main_~g~0 (* 3 main_~y~0)) 63) (= 18 main_~y~0))} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % ~g~0 then (if ~g~0 < 0 then ~x~0 % ~g~0 + ~g~0 else ~x~0 % ~g~0 - ~g~0) else ~x~0 % ~g~0) then 1 else 0)); {3805#true} is VALID [2020-07-10 14:48:07,627 INFO L280 TraceCheckUtils]: 26: Hoare triple {3805#true} ~cond := #in~cond; {3805#true} is VALID [2020-07-10 14:48:07,628 INFO L280 TraceCheckUtils]: 27: Hoare triple {3805#true} assume !(0 == ~cond); {3805#true} is VALID [2020-07-10 14:48:07,628 INFO L280 TraceCheckUtils]: 28: Hoare triple {3805#true} assume true; {3805#true} is VALID [2020-07-10 14:48:07,631 INFO L275 TraceCheckUtils]: 29: Hoare quadruple {3805#true} {3889#(and (= (+ main_~g~0 (* 3 main_~y~0)) 63) (= 18 main_~y~0))} #67#return; {3889#(and (= (+ main_~g~0 (* 3 main_~y~0)) 63) (= 18 main_~y~0))} is VALID [2020-07-10 14:48:07,634 INFO L263 TraceCheckUtils]: 30: Hoare triple {3889#(and (= (+ main_~g~0 (* 3 main_~y~0)) 63) (= 18 main_~y~0))} call __VERIFIER_assert((if 0 == (if ~y~0 < 0 && 0 != ~y~0 % ~g~0 then (if ~g~0 < 0 then ~y~0 % ~g~0 + ~g~0 else ~y~0 % ~g~0 - ~g~0) else ~y~0 % ~g~0) then 1 else 0)); {3908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 14:48:07,638 INFO L280 TraceCheckUtils]: 31: Hoare triple {3908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 14:48:07,641 INFO L280 TraceCheckUtils]: 32: Hoare triple {3912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3806#false} is VALID [2020-07-10 14:48:07,641 INFO L280 TraceCheckUtils]: 33: Hoare triple {3806#false} assume !false; {3806#false} is VALID [2020-07-10 14:48:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 14:48:07,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240140030] [2020-07-10 14:48:07,644 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 14:48:07,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578110201] [2020-07-10 14:48:07,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 14:48:07,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-10 14:48:07,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720813861] [2020-07-10 14:48:07,645 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-10 14:48:07,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:48:07,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 14:48:08,017 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-10 14:48:08,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 14:48:08,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:48:08,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 14:48:08,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-07-10 14:48:08,019 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand 12 states. [2020-07-10 14:48:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:48:13,768 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2020-07-10 14:48:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 14:48:13,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-10 14:48:13,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:48:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:48:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2020-07-10 14:48:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 14:48:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2020-07-10 14:48:13,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2020-07-10 14:48:14,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:48:14,127 INFO L225 Difference]: With dead ends: 35 [2020-07-10 14:48:14,127 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:48:14,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-10 14:48:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:48:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:48:14,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:48:14,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:48:14,128 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:48:14,128 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:48:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:48:14,128 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:48:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:48:14,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:48:14,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:48:14,129 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:48:14,129 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:48:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:48:14,129 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:48:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:48:14,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:48:14,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:48:14,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:48:14,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:48:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:48:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:48:14,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-10 14:48:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:48:14,130 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:48:14,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 14:48:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:48:14,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:48:14,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-10 14:48:14,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:48:14,960 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2020-07-10 14:48:15,193 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2020-07-10 14:48:15,546 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2020-07-10 14:48:15,736 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2020-07-10 14:48:26,564 WARN L193 SmtUtils]: Spent 10.81 s on a formula simplification. DAG size of input: 134 DAG size of output: 77 [2020-07-10 14:48:26,644 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:48:26,644 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:48:26,645 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:48:26,645 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:48:26,645 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:48:26,645 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:48:26,645 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 30 46) the Hoare annotation is: true [2020-07-10 14:48:26,645 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 30 46) no Hoare annotation was computed. [2020-07-10 14:48:26,645 INFO L268 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2020-07-10 14:48:26,646 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (<= main_~y~0 18) (<= 18 main_~y~0) (= main_~x~0 (* main_~g~0 7)) (= 63 main_~x~0)) [2020-07-10 14:48:26,646 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= 18 main_~y~0) (= main_~x~0 (* main_~g~0 7)) (= 63 main_~x~0)) [2020-07-10 14:48:26,646 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 30 46) no Hoare annotation was computed. [2020-07-10 14:48:26,646 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= 18 main_~y~0) (= main_~x~0 (* main_~g~0 7)) (= 63 main_~x~0)) [2020-07-10 14:48:26,646 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= 18 main_~y~0) (= 63 main_~x~0)) [2020-07-10 14:48:26,646 INFO L268 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2020-07-10 14:48:26,646 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2020-07-10 14:48:26,646 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-10 14:48:26,647 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-10 14:48:26,647 INFO L268 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2020-07-10 14:48:26,647 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-10 14:48:26,647 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2020-07-10 14:48:26,647 INFO L268 CegarLoopResult]: For program point gcd_testEXIT(lines 10 27) no Hoare annotation was computed. [2020-07-10 14:48:26,647 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 25) no Hoare annotation was computed. [2020-07-10 14:48:26,647 INFO L268 CegarLoopResult]: For program point L13-1(lines 11 27) no Hoare annotation was computed. [2020-07-10 14:48:26,647 INFO L271 CegarLoopResult]: At program point gcd_testENTRY(lines 10 27) the Hoare annotation is: true [2020-07-10 14:48:26,647 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-07-10 14:48:26,649 INFO L264 CegarLoopResult]: At program point L20-2(lines 19 25) the Hoare annotation is: (let ((.cse0 (* 2 gcd_test_~b)) (.cse5 (+ gcd_test_~b gcd_test_~a)) (.cse2 (* 2 |gcd_test_#in~a|)) (.cse1 (* 7 |gcd_test_#in~b|)) (.cse3 (= gcd_test_~b |gcd_test_#in~b|))) (or (and (<= (+ (* 21 |gcd_test_#in~b|) 1) (+ .cse0 (* 6 |gcd_test_#in~a|))) (<= (+ .cse1 1) .cse2)) (and (= |gcd_test_#in~a| (+ gcd_test_~a (* |gcd_test_#in~b| 3))) (<= (+ (* 3 gcd_test_~b) gcd_test_~a) |gcd_test_#in~a|) (<= |gcd_test_#in~b| gcd_test_~b)) (let ((.cse4 (+ .cse0 gcd_test_~a))) (and .cse3 (<= .cse4 |gcd_test_#in~a|) (<= |gcd_test_#in~a| .cse4))) (and (exists ((gcd_test_~a Int)) (and (<= |gcd_test_#in~b| (+ gcd_test_~b gcd_test_~a)) (<= |gcd_test_#in~b| (div (+ (* gcd_test_~a (- 1)) |gcd_test_#in~a|) 3)))) (<= .cse5 |gcd_test_#in~b|) (<= (div (+ gcd_test_~a (* |gcd_test_#in~a| (- 1))) (- 3)) |gcd_test_#in~b|)) (and (<= |gcd_test_#in~a| 0) (<= |gcd_test_#in~a| gcd_test_~a)) (and .cse3 (<= |gcd_test_#in~a| .cse5) (<= .cse5 |gcd_test_#in~a|)) (<= (+ .cse2 1) .cse1) (<= |gcd_test_#in~a| |gcd_test_#in~b|) (and .cse3 (= gcd_test_~a |gcd_test_#in~a|)) (and (exists ((v_gcd_test_~a_30 Int)) (and (<= (+ gcd_test_~b (* 2 v_gcd_test_~a_30)) |gcd_test_#in~b|) (<= v_gcd_test_~a_30 (+ gcd_test_~b gcd_test_~a)) (<= (div (+ (* |gcd_test_#in~a| (- 1)) v_gcd_test_~a_30) (- 3)) |gcd_test_#in~b|))) (<= (+ gcd_test_~b (* 2 gcd_test_~a)) |gcd_test_#in~b|)))) [2020-07-10 14:48:26,649 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-10 14:48:26,649 INFO L268 CegarLoopResult]: For program point L12-2(lines 11 27) no Hoare annotation was computed. [2020-07-10 14:48:26,649 INFO L268 CegarLoopResult]: For program point gcd_testFINAL(lines 10 27) no Hoare annotation was computed. [2020-07-10 14:48:26,653 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:48:26,657 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:48:26,657 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 14:48:26,657 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:48:26,657 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-10 14:48:26,658 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: gcd_testFINAL has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: gcd_testEXIT has no Hoare annotation [2020-07-10 14:48:26,659 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-10 14:48:26,660 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:48:26,660 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 14:48:26,660 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:48:26,660 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:48:26,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-10 14:48:26,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-10 14:48:26,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-10 14:48:26,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-10 14:48:26,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:48:26 BoogieIcfgContainer [2020-07-10 14:48:26,683 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:48:26,685 INFO L168 Benchmark]: Toolchain (without parser) took 349395.70 ms. Allocated memory was 138.9 MB in the beginning and 240.1 MB in the end (delta: 101.2 MB). Free memory was 103.9 MB in the beginning and 134.7 MB in the end (delta: -30.8 MB). Peak memory consumption was 70.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:48:26,685 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:48:26,686 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.73 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 93.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 14:48:26,686 INFO L168 Benchmark]: Boogie Preprocessor took 118.66 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.7 MB in the beginning and 182.6 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-10 14:48:26,687 INFO L168 Benchmark]: RCFGBuilder took 436.70 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 163.0 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:48:26,688 INFO L168 Benchmark]: TraceAbstraction took 348578.42 ms. Allocated memory was 203.4 MB in the beginning and 240.1 MB in the end (delta: 36.7 MB). Free memory was 162.3 MB in the beginning and 134.7 MB in the end (delta: 27.6 MB). Peak memory consumption was 64.3 MB. Max. memory is 7.1 GB. [2020-07-10 14:48:26,690 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 256.73 ms. Allocated memory is still 138.9 MB. Free memory was 103.5 MB in the beginning and 93.7 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.66 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 93.7 MB in the beginning and 182.6 MB in the end (delta: -88.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 436.70 ms. Allocated memory is still 203.4 MB. Free memory was 182.6 MB in the beginning and 163.0 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 348578.42 ms. Allocated memory was 203.4 MB in the beginning and 240.1 MB in the end (delta: 36.7 MB). Free memory was 162.3 MB in the beginning and 134.7 MB in the end (delta: 27.6 MB). Peak memory consumption was 64.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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 - InvariantResult [Line: 19]: Loop Invariant [2020-07-10 14:48:26,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-10 14:48:26,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-10 14:48:26,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,697 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-10 14:48:26,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-10 14:48:26,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-10 14:48:26,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] Derived loop invariant: (((((((((21 * \old(b) + 1 <= 2 * b + 6 * \old(a) && 7 * \old(b) + 1 <= 2 * \old(a)) || ((\old(a) == a + \old(b) * 3 && 3 * b + a <= \old(a)) && \old(b) <= b)) || ((b == \old(b) && 2 * b + a <= \old(a)) && \old(a) <= 2 * b + a)) || (((\exists gcd_test_~a : int :: \old(b) <= b + gcd_test_~a && \old(b) <= (gcd_test_~a * -1 + \old(a)) / 3) && b + a <= \old(b)) && (a + \old(a) * -1) / -3 <= \old(b))) || (\old(a) <= 0 && \old(a) <= a)) || ((b == \old(b) && \old(a) <= b + a) && b + a <= \old(a))) || 2 * \old(a) + 1 <= 7 * \old(b)) || \old(a) <= \old(b)) || (b == \old(b) && a == \old(a))) || ((\exists v_gcd_test_~a_30 : int :: (b + 2 * v_gcd_test_~a_30 <= \old(b) && v_gcd_test_~a_30 <= b + a) && (\old(a) * -1 + v_gcd_test_~a_30) / -3 <= \old(b)) && b + 2 * a <= \old(b)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 336.1s, OverallIterations: 14, TraceHistogramMax: 7, AutomataDifference: 295.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 307 SDtfs, 267 SDslu, 1707 SDs, 0 SdLazy, 1853 SolverSat, 110 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 97.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 90.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 49 PreInvPairs, 90 NumberOfFragments, 214 HoareAnnotationTreeSize, 49 FomulaSimplifications, 1067 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 11 FomulaSimplificationsInter, 412 FormulaSimplificationTreeSizeReductionInter, 11.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 34.0s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 461 ConstructedInterpolants, 20 QuantifiedInterpolants, 75215 SizeOfPredicates, 42 NumberOfNonLiveVariables, 732 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 48/376 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...