/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-267fbe0 [2020-07-17 22:06:09,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:06:09,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:06:09,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:06:09,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:06:09,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:06:09,848 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:06:09,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:06:09,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:06:09,852 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:06:09,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:06:09,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:06:09,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:06:09,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:06:09,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:06:09,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:06:09,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:06:09,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:06:09,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:06:09,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:06:09,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:06:09,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:06:09,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:06:09,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:06:09,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:06:09,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:06:09,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:06:09,875 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:06:09,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:06:09,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:06:09,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:06:09,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:06:09,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:06:09,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:06:09,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:06:09,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:06:09,890 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:06:09,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:06:09,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:06:09,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:06:09,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:06:09,901 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-17 22:06:09,931 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:06:09,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:06:09,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:06:09,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:06:09,934 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:06:09,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:06:09,935 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:06:09,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:06:09,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:06:09,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:06:09,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:06:09,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:06:09,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:06:09,938 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:06:09,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:06:09,938 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:06:09,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:06:09,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:06:09,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:06:09,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:06:09,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:06:09,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:06:09,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:06:09,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:06:09,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:06:09,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:06:09,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:06:09,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:06:09,941 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:06:09,941 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:06:10,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:06:10,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:06:10,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:06:10,230 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:06:10,231 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:06:10,232 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-17 22:06:10,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c265c2a5f/3cb8da6adb734ccf87d27ae416b416df/FLAG1885a8519 [2020-07-17 22:06:10,742 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:06:10,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_4.c [2020-07-17 22:06:10,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c265c2a5f/3cb8da6adb734ccf87d27ae416b416df/FLAG1885a8519 [2020-07-17 22:06:11,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c265c2a5f/3cb8da6adb734ccf87d27ae416b416df [2020-07-17 22:06:11,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:06:11,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:06:11,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:06:11,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:06:11,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:06:11,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:06:11" (1/1) ... [2020-07-17 22:06:11,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41662aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11, skipping insertion in model container [2020-07-17 22:06:11,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:06:11" (1/1) ... [2020-07-17 22:06:11,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:06:11,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:06:11,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:06:11,393 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:06:11,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:06:11,427 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:06:11,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11 WrapperNode [2020-07-17 22:06:11,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:06:11,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:06:11,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:06:11,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:06:11,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11" (1/1) ... [2020-07-17 22:06:11,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11" (1/1) ... [2020-07-17 22:06:11,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11" (1/1) ... [2020-07-17 22:06:11,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11" (1/1) ... [2020-07-17 22:06:11,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11" (1/1) ... [2020-07-17 22:06:11,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11" (1/1) ... [2020-07-17 22:06:11,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11" (1/1) ... [2020-07-17 22:06:11,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:06:11,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:06:11,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:06:11,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:06:11,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11" (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-17 22:06:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:06:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:06:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:06:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd_test [2020-07-17 22:06:11,622 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:06:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:06:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:06:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:06:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure gcd_test [2020-07-17 22:06:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:06:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:06:11,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:06:11,949 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:06:11,949 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:06:11,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:06:11 BoogieIcfgContainer [2020-07-17 22:06:11,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:06:11,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:06:11,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:06:11,976 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:06:11,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:06:11" (1/3) ... [2020-07-17 22:06:11,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58737123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:06:11, skipping insertion in model container [2020-07-17 22:06:11,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:06:11" (2/3) ... [2020-07-17 22:06:11,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58737123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:06:11, skipping insertion in model container [2020-07-17 22:06:11,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:06:11" (3/3) ... [2020-07-17 22:06:11,980 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd_4.c [2020-07-17 22:06:11,992 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:06:11,997 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:06:12,008 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:06:12,031 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:06:12,031 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:06:12,032 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:06:12,032 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:06:12,032 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:06:12,032 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:06:12,032 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:06:12,032 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:06:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-17 22:06:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:06:12,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:12,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:12,056 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:12,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:12,061 INFO L82 PathProgramCache]: Analyzing trace with hash 876608673, now seen corresponding path program 1 times [2020-07-17 22:06:12,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:12,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147891201] [2020-07-17 22:06:12,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:12,270 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-17 22:06:12,271 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {33#true} {33#true} #61#return; {33#true} is VALID [2020-07-17 22:06:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:12,309 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} ~a := #in~a;~b := #in~b; {33#true} is VALID [2020-07-17 22:06:12,310 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume ~a < 0;~a := -~a; {44#(<= 1 gcd_test_~a)} is VALID [2020-07-17 22:06:12,311 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-17 22:06:12,312 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#(<= 1 gcd_test_~a)} assume 0 == ~a;#res := ~b; {34#false} is VALID [2020-07-17 22:06:12,312 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#false} assume true; {34#false} is VALID [2020-07-17 22:06:12,313 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {34#false} {37#(<= 63 main_~x~0)} #65#return; {34#false} is VALID [2020-07-17 22:06:12,314 INFO L263 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2020-07-17 22:06:12,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2020-07-17 22:06:12,314 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #61#return; {33#true} is VALID [2020-07-17 22:06:12,315 INFO L263 TraceCheckUtils]: 3: Hoare triple {33#true} call #t~ret1 := main(); {33#true} is VALID [2020-07-17 22:06:12,323 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-17 22:06:12,323 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-17 22:06:12,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#true} ~a := #in~a;~b := #in~b; {33#true} is VALID [2020-07-17 22:06:12,332 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#true} assume ~a < 0;~a := -~a; {44#(<= 1 gcd_test_~a)} is VALID [2020-07-17 22:06:12,334 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-17 22:06:12,336 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#(<= 1 gcd_test_~a)} assume 0 == ~a;#res := ~b; {34#false} is VALID [2020-07-17 22:06:12,336 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#false} assume true; {34#false} is VALID [2020-07-17 22:06:12,337 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {34#false} {37#(<= 63 main_~x~0)} #65#return; {34#false} is VALID [2020-07-17 22:06:12,337 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-17 22:06:12,340 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-17 22:06:12,340 INFO L280 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2020-07-17 22:06:12,340 INFO L280 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2020-07-17 22:06:12,341 INFO L280 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-17 22:06:12,344 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-17 22:06:12,345 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147891201] [2020-07-17 22:06:12,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:12,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:06:12,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993113431] [2020-07-17 22:06:12,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-17 22:06:12,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:12,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:06:12,410 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-17 22:06:12,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:06:12,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:06:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:06:12,424 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2020-07-17 22:06:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:12,700 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2020-07-17 22:06:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:06:12,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-17 22:06:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:06:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-17 22:06:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:06:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2020-07-17 22:06:12,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2020-07-17 22:06:12,845 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-17 22:06:12,858 INFO L225 Difference]: With dead ends: 55 [2020-07-17 22:06:12,859 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 22:06:12,863 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-17 22:06:12,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 22:06:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2020-07-17 22:06:12,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:12,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2020-07-17 22:06:12,921 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2020-07-17 22:06:12,921 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2020-07-17 22:06:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:12,928 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-07-17 22:06:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2020-07-17 22:06:12,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:12,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:12,930 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2020-07-17 22:06:12,930 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2020-07-17 22:06:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:12,936 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-07-17 22:06:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2020-07-17 22:06:12,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:12,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:12,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:12,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:06:12,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-07-17 22:06:12,943 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 17 [2020-07-17 22:06:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:12,943 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-17 22:06:12,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:06:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-17 22:06:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:06:12,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:12,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:06:12,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:06:12,946 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:12,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash 483581663, now seen corresponding path program 1 times [2020-07-17 22:06:12,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:12,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940603992] [2020-07-17 22:06:12,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:12,968 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:06:12,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728723100] [2020-07-17 22:06:12,969 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) [2020-07-17 22:06:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:13,042 INFO L264 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:06:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:13,062 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:13,190 INFO L263 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2020-07-17 22:06:13,191 INFO L280 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2020-07-17 22:06:13,191 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #61#return; {220#true} is VALID [2020-07-17 22:06:13,191 INFO L263 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret1 := main(); {220#true} is VALID [2020-07-17 22:06:13,193 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-17 22:06:13,193 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-17 22:06:13,194 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-17 22:06:13,195 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-17 22:06:13,196 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-17 22:06:13,198 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-17 22:06:13,199 INFO L280 TraceCheckUtils]: 10: Hoare triple {254#(<= |gcd_test_#in~a| 0)} assume true; {254#(<= |gcd_test_#in~a| 0)} is VALID [2020-07-17 22:06:13,201 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-17 22:06:13,201 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-17 22:06:13,202 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-17 22:06:13,202 INFO L280 TraceCheckUtils]: 14: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2020-07-17 22:06:13,202 INFO L280 TraceCheckUtils]: 15: Hoare triple {221#false} assume 0 == ~cond; {221#false} is VALID [2020-07-17 22:06:13,203 INFO L280 TraceCheckUtils]: 16: Hoare triple {221#false} assume !false; {221#false} is VALID [2020-07-17 22:06:13,204 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-17 22:06:13,205 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940603992] [2020-07-17 22:06:13,205 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:06:13,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728723100] [2020-07-17 22:06:13,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:13,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:06:13,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484859671] [2020-07-17 22:06:13,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:06:13,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:13,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:06:13,235 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-17 22:06:13,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:06:13,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:13,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:06:13,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:06:13,236 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 5 states. [2020-07-17 22:06:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:13,529 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2020-07-17 22:06:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:06:13,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 22:06:13,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:06:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-17 22:06:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:06:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2020-07-17 22:06:13,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2020-07-17 22:06:13,629 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-17 22:06:13,631 INFO L225 Difference]: With dead ends: 47 [2020-07-17 22:06:13,631 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:06:13,633 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-17 22:06:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:06:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-17 22:06:13,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:13,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 25 states. [2020-07-17 22:06:13,646 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 25 states. [2020-07-17 22:06:13,646 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 25 states. [2020-07-17 22:06:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:13,650 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-17 22:06:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-17 22:06:13,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:13,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:13,651 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states. [2020-07-17 22:06:13,651 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states. [2020-07-17 22:06:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:13,655 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-17 22:06:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-07-17 22:06:13,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:13,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:13,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:13,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:06:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-17 22:06:13,659 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2020-07-17 22:06:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:13,660 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-17 22:06:13,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:06:13,660 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-17 22:06:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:06:13,661 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:13,661 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-17 22:06:13,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:06:13,875 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:13,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:13,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1158269966, now seen corresponding path program 1 times [2020-07-17 22:06:13,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:13,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224291708] [2020-07-17 22:06:13,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:13,887 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:06:13,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1347081853] [2020-07-17 22:06:13,888 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) [2020-07-17 22:06:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:13,916 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:13,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:13,995 INFO L263 TraceCheckUtils]: 0: Hoare triple {437#true} call ULTIMATE.init(); {437#true} is VALID [2020-07-17 22:06:13,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {437#true} assume true; {437#true} is VALID [2020-07-17 22:06:13,995 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {437#true} {437#true} #61#return; {437#true} is VALID [2020-07-17 22:06:13,996 INFO L263 TraceCheckUtils]: 3: Hoare triple {437#true} call #t~ret1 := main(); {437#true} is VALID [2020-07-17 22:06:13,997 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-17 22:06:13,997 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-17 22:06:13,998 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-17 22:06:13,999 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-17 22:06:14,000 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-17 22:06:14,001 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-17 22:06:14,001 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-17 22:06:14,002 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-17 22:06:14,003 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-17 22:06:14,004 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-17 22:06:14,005 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-17 22:06:14,005 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-17 22:06:14,006 INFO L280 TraceCheckUtils]: 16: Hoare triple {438#false} ~cond := #in~cond; {438#false} is VALID [2020-07-17 22:06:14,006 INFO L280 TraceCheckUtils]: 17: Hoare triple {438#false} assume 0 == ~cond; {438#false} is VALID [2020-07-17 22:06:14,006 INFO L280 TraceCheckUtils]: 18: Hoare triple {438#false} assume !false; {438#false} is VALID [2020-07-17 22:06:14,007 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-17 22:06:14,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224291708] [2020-07-17 22:06:14,008 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:06:14,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347081853] [2020-07-17 22:06:14,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:14,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:06:14,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796786807] [2020-07-17 22:06:14,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:06:14,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:14,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:06:14,033 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-17 22:06:14,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:06:14,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:14,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:06:14,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:06:14,034 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2020-07-17 22:06:14,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:14,285 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2020-07-17 22:06:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:06:14,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:06:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:06:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-17 22:06:14,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:06:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-17 22:06:14,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2020-07-17 22:06:14,402 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-17 22:06:14,404 INFO L225 Difference]: With dead ends: 46 [2020-07-17 22:06:14,408 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:06:14,408 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-17 22:06:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:06:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2020-07-17 22:06:14,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:14,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 25 states. [2020-07-17 22:06:14,426 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 25 states. [2020-07-17 22:06:14,426 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 25 states. [2020-07-17 22:06:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:14,430 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-17 22:06:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-17 22:06:14,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:14,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:14,432 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 30 states. [2020-07-17 22:06:14,432 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 30 states. [2020-07-17 22:06:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:14,435 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-17 22:06:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-17 22:06:14,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:14,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:14,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:14,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:06:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2020-07-17 22:06:14,446 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2020-07-17 22:06:14,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:14,446 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2020-07-17 22:06:14,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:06:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2020-07-17 22:06:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:06:14,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:14,449 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-17 22:06:14,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:14,665 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash -457205388, now seen corresponding path program 1 times [2020-07-17 22:06:14,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:14,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519743458] [2020-07-17 22:06:14,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:14,677 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:06:14,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478331331] [2020-07-17 22:06:14,678 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) [2020-07-17 22:06:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:14,706 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:14,717 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:14,785 INFO L263 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2020-07-17 22:06:14,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2020-07-17 22:06:14,786 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #61#return; {659#true} is VALID [2020-07-17 22:06:14,786 INFO L263 TraceCheckUtils]: 3: Hoare triple {659#true} call #t~ret1 := main(); {659#true} is VALID [2020-07-17 22:06:14,787 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-17 22:06:14,788 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-17 22:06:14,789 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-17 22:06:14,790 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-17 22:06:14,791 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-17 22:06:14,792 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-17 22:06:14,793 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-17 22:06:14,794 INFO L280 TraceCheckUtils]: 11: Hoare triple {696#(<= |gcd_test_#in~b| 0)} #res := ~a; {696#(<= |gcd_test_#in~b| 0)} is VALID [2020-07-17 22:06:14,795 INFO L280 TraceCheckUtils]: 12: Hoare triple {696#(<= |gcd_test_#in~b| 0)} assume true; {696#(<= |gcd_test_#in~b| 0)} is VALID [2020-07-17 22:06:14,796 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-17 22:06:14,797 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-17 22:06:14,797 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-17 22:06:14,797 INFO L280 TraceCheckUtils]: 16: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2020-07-17 22:06:14,798 INFO L280 TraceCheckUtils]: 17: Hoare triple {660#false} assume 0 == ~cond; {660#false} is VALID [2020-07-17 22:06:14,798 INFO L280 TraceCheckUtils]: 18: Hoare triple {660#false} assume !false; {660#false} is VALID [2020-07-17 22:06:14,798 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-17 22:06:14,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519743458] [2020-07-17 22:06:14,799 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:06:14,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478331331] [2020-07-17 22:06:14,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:06:14,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:06:14,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245036254] [2020-07-17 22:06:14,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:06:14,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:14,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:06:14,822 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-17 22:06:14,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:06:14,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:14,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:06:14,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:06:14,824 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2020-07-17 22:06:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:15,006 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-17 22:06:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:06:15,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:06:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:06:15,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2020-07-17 22:06:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:06:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2020-07-17 22:06:15,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2020-07-17 22:06:15,094 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-17 22:06:15,096 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:06:15,096 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:06:15,097 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-17 22:06:15,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:06:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-17 22:06:15,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:15,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-17 22:06:15,113 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:06:15,114 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:06:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:15,116 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-17 22:06:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-17 22:06:15,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:15,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:15,117 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:06:15,117 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:06:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:15,119 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-07-17 22:06:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-17 22:06:15,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:15,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:15,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:15,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:06:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-17 22:06:15,123 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2020-07-17 22:06:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:15,123 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-17 22:06:15,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:06:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-17 22:06:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:06:15,124 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:15,124 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-17 22:06:15,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:15,338 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1431348209, now seen corresponding path program 1 times [2020-07-17 22:06:15,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:15,340 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325003829] [2020-07-17 22:06:15,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:15,351 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:06:15,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790077051] [2020-07-17 22:06:15,352 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-17 22:06:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:15,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:06:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:15,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:15,530 INFO L263 TraceCheckUtils]: 0: Hoare triple {871#true} call ULTIMATE.init(); {871#true} is VALID [2020-07-17 22:06:15,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {871#true} assume true; {871#true} is VALID [2020-07-17 22:06:15,531 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {871#true} {871#true} #61#return; {871#true} is VALID [2020-07-17 22:06:15,532 INFO L263 TraceCheckUtils]: 3: Hoare triple {871#true} call #t~ret1 := main(); {871#true} is VALID [2020-07-17 22:06:15,532 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-17 22:06:15,533 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-17 22:06:15,533 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-17 22:06:15,534 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-17 22:06:15,534 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-17 22:06:15,535 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-17 22:06:15,536 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-17 22:06:15,537 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-17 22:06:15,537 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-17 22:06:15,538 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-17 22:06:15,538 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-17 22:06:15,544 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-17 22:06:15,545 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-17 22:06:15,545 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-17 22:06:15,545 INFO L280 TraceCheckUtils]: 18: Hoare triple {872#false} ~cond := #in~cond; {872#false} is VALID [2020-07-17 22:06:15,546 INFO L280 TraceCheckUtils]: 19: Hoare triple {872#false} assume 0 == ~cond; {872#false} is VALID [2020-07-17 22:06:15,546 INFO L280 TraceCheckUtils]: 20: Hoare triple {872#false} assume !false; {872#false} is VALID [2020-07-17 22:06:15,547 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-17 22:06:15,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325003829] [2020-07-17 22:06:15,548 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:06:15,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790077051] [2020-07-17 22:06:15,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:06:15,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 22:06:15,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435087436] [2020-07-17 22:06:15,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-17 22:06:15,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:15,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:06:15,574 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-17 22:06:15,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:06:15,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:15,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:06:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:06:15,576 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2020-07-17 22:06:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:15,914 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2020-07-17 22:06:15,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:06:15,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-17 22:06:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-17 22:06:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:06:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2020-07-17 22:06:15,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2020-07-17 22:06:16,009 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-17 22:06:16,010 INFO L225 Difference]: With dead ends: 46 [2020-07-17 22:06:16,010 INFO L226 Difference]: Without dead ends: 29 [2020-07-17 22:06:16,011 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-17 22:06:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-17 22:06:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-17 22:06:16,038 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:16,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-17 22:06:16,038 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:06:16,038 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:06:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:16,040 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-17 22:06:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-17 22:06:16,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:16,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:16,042 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-17 22:06:16,042 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-17 22:06:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:16,044 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2020-07-17 22:06:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-17 22:06:16,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:16,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:16,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:16,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-17 22:06:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-17 22:06:16,047 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2020-07-17 22:06:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:16,048 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-17 22:06:16,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:06:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-17 22:06:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:06:16,049 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:16,049 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-17 22:06:16,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:16,263 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:16,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1537894100, now seen corresponding path program 1 times [2020-07-17 22:06:16,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:16,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158221274] [2020-07-17 22:06:16,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:16,281 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:06:16,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [962144090] [2020-07-17 22:06:16,282 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-17 22:06:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:16,303 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:06:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:16,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:16,492 INFO L263 TraceCheckUtils]: 0: Hoare triple {1106#true} call ULTIMATE.init(); {1106#true} is VALID [2020-07-17 22:06:16,492 INFO L280 TraceCheckUtils]: 1: Hoare triple {1106#true} assume true; {1106#true} is VALID [2020-07-17 22:06:16,493 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1106#true} {1106#true} #61#return; {1106#true} is VALID [2020-07-17 22:06:16,493 INFO L263 TraceCheckUtils]: 3: Hoare triple {1106#true} call #t~ret1 := main(); {1106#true} is VALID [2020-07-17 22:06:16,496 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-17 22:06:16,496 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-17 22:06:16,498 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-17 22:06:16,499 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-17 22:06:16,499 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-17 22:06:16,503 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-17 22:06:16,506 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-17 22:06:16,508 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-17 22:06:16,509 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-17 22:06:16,510 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-17 22:06:16,510 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-17 22:06:16,511 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-17 22:06:16,511 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-17 22:06:16,513 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-17 22:06:16,513 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-17 22:06:16,514 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-17 22:06:16,514 INFO L280 TraceCheckUtils]: 20: Hoare triple {1107#false} ~cond := #in~cond; {1107#false} is VALID [2020-07-17 22:06:16,514 INFO L280 TraceCheckUtils]: 21: Hoare triple {1107#false} assume 0 == ~cond; {1107#false} is VALID [2020-07-17 22:06:16,514 INFO L280 TraceCheckUtils]: 22: Hoare triple {1107#false} assume !false; {1107#false} is VALID [2020-07-17 22:06:16,516 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-17 22:06:16,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158221274] [2020-07-17 22:06:16,516 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:06:16,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962144090] [2020-07-17 22:06:16,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:06:16,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:06:16,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015204702] [2020-07-17 22:06:16,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-17 22:06:16,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:16,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:06:16,546 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-17 22:06:16,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:06:16,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:16,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:06:16,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:06:16,548 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2020-07-17 22:06:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:16,897 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-17 22:06:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:06:16,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-17 22:06:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:06:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2020-07-17 22:06:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:06:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2020-07-17 22:06:16,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2020-07-17 22:06:16,972 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-17 22:06:16,973 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:06:16,973 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:06:16,975 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-17 22:06:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:06:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-17 22:06:17,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:17,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-17 22:06:17,008 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:06:17,009 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:06:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:17,019 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:06:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:06:17,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:17,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:17,020 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:06:17,020 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:06:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:17,026 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:06:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:06:17,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:17,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:17,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:17,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:06:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-17 22:06:17,034 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2020-07-17 22:06:17,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:17,035 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-17 22:06:17,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:06:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:06:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:06:17,036 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:17,036 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-17 22:06:17,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:06:17,238 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:17,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:17,239 INFO L82 PathProgramCache]: Analyzing trace with hash -849280247, now seen corresponding path program 2 times [2020-07-17 22:06:17,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:17,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401016124] [2020-07-17 22:06:17,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:17,251 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:06:17,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [467495249] [2020-07-17 22:06:17,252 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-17 22:06:17,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:06:17,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:06:17,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:06:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:17,300 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:19,693 INFO L263 TraceCheckUtils]: 0: Hoare triple {1360#true} call ULTIMATE.init(); {1360#true} is VALID [2020-07-17 22:06:19,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {1360#true} assume true; {1360#true} is VALID [2020-07-17 22:06:19,694 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1360#true} {1360#true} #61#return; {1360#true} is VALID [2020-07-17 22:06:19,695 INFO L263 TraceCheckUtils]: 3: Hoare triple {1360#true} call #t~ret1 := main(); {1360#true} is VALID [2020-07-17 22:06:19,696 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-17 22:06:19,696 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-17 22:06:19,697 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-17 22:06:19,698 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-17 22:06:19,698 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-17 22:06:19,699 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-17 22:06:19,700 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-17 22:06:19,702 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-17 22:06:19,703 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-17 22:06:19,704 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-17 22:06:19,705 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-17 22:06:19,707 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-17 22:06:19,709 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-17 22:06:19,710 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-17 22:06:19,711 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-17 22:06:19,712 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-17 22:06:19,712 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-17 22:06:19,713 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-17 22:06:19,713 INFO L280 TraceCheckUtils]: 22: Hoare triple {1361#false} ~cond := #in~cond; {1361#false} is VALID [2020-07-17 22:06:19,713 INFO L280 TraceCheckUtils]: 23: Hoare triple {1361#false} assume 0 == ~cond; {1361#false} is VALID [2020-07-17 22:06:19,713 INFO L280 TraceCheckUtils]: 24: Hoare triple {1361#false} assume !false; {1361#false} is VALID [2020-07-17 22:06:19,715 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-17 22:06:19,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401016124] [2020-07-17 22:06:19,716 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:06:19,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467495249] [2020-07-17 22:06:19,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:06:19,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 22:06:19,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873097807] [2020-07-17 22:06:19,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-17 22:06:19,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:19,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:06:19,764 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-17 22:06:19,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:06:19,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:19,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:06:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=42, Unknown=1, NotChecked=0, Total=56 [2020-07-17 22:06:19,766 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 8 states. [2020-07-17 22:06:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:25,027 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2020-07-17 22:06:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:06:25,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-07-17 22:06:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:06:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-17 22:06:25,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:06:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-17 22:06:25,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2020-07-17 22:06:25,152 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-17 22:06:25,154 INFO L225 Difference]: With dead ends: 50 [2020-07-17 22:06:25,154 INFO L226 Difference]: Without dead ends: 33 [2020-07-17 22:06:25,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2020-07-17 22:06:25,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-17 22:06:25,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-17 22:06:25,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:25,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2020-07-17 22:06:25,183 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:06:25,183 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:06:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:25,186 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-17 22:06:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-17 22:06:25,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:25,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:25,188 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2020-07-17 22:06:25,188 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2020-07-17 22:06:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:25,191 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-17 22:06:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-17 22:06:25,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:25,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:25,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:25,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:06:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-17 22:06:25,195 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2020-07-17 22:06:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:25,197 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-17 22:06:25,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:06:25,198 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-17 22:06:25,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:06:25,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:25,199 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-17 22:06:25,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:25,409 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:25,410 INFO L82 PathProgramCache]: Analyzing trace with hash -516331098, now seen corresponding path program 3 times [2020-07-17 22:06:25,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:25,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700827740] [2020-07-17 22:06:25,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:25,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-17 22:06:25,473 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1633#true} {1633#true} #61#return; {1633#true} is VALID [2020-07-17 22:06:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:25,651 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-17 22:06:25,652 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-17 22:06:25,653 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-17 22:06:25,654 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-17 22:06:25,655 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-17 22:06:25,655 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-17 22:06:25,656 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-17 22:06:25,657 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-17 22:06:25,658 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-17 22:06:25,660 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-17 22:06:25,661 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-17 22:06:25,662 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-17 22:06:25,663 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-17 22:06:25,664 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-17 22:06:25,664 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-17 22:06:25,666 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-17 22:06:25,667 INFO L263 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2020-07-17 22:06:25,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-17 22:06:25,667 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #61#return; {1633#true} is VALID [2020-07-17 22:06:25,667 INFO L263 TraceCheckUtils]: 3: Hoare triple {1633#true} call #t~ret1 := main(); {1633#true} is VALID [2020-07-17 22:06:25,668 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-17 22:06:25,668 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-17 22:06:25,669 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-17 22:06:25,669 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-17 22:06:25,670 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-17 22:06:25,671 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-17 22:06:25,671 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-17 22:06:25,672 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-17 22:06:25,673 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-17 22:06:25,674 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-17 22:06:25,676 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-17 22:06:25,678 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-17 22:06:25,679 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-17 22:06:25,680 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-17 22:06:25,681 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-17 22:06:25,682 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-17 22:06:25,682 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-17 22:06:25,683 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-17 22:06:25,684 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-17 22:06:25,684 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-17 22:06:25,684 INFO L280 TraceCheckUtils]: 24: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2020-07-17 22:06:25,685 INFO L280 TraceCheckUtils]: 25: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2020-07-17 22:06:25,685 INFO L280 TraceCheckUtils]: 26: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2020-07-17 22:06:25,687 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-17 22:06:25,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700827740] [2020-07-17 22:06:25,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127016107] [2020-07-17 22:06:25,688 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-17 22:06:25,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-17 22:06:25,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:06:25,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:06:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:25,742 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:30,248 INFO L263 TraceCheckUtils]: 0: Hoare triple {1633#true} call ULTIMATE.init(); {1633#true} is VALID [2020-07-17 22:06:30,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {1633#true} assume true; {1633#true} is VALID [2020-07-17 22:06:30,248 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1633#true} {1633#true} #61#return; {1633#true} is VALID [2020-07-17 22:06:30,249 INFO L263 TraceCheckUtils]: 3: Hoare triple {1633#true} call #t~ret1 := main(); {1633#true} is VALID [2020-07-17 22:06:30,250 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-17 22:06:30,250 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-17 22:06:30,251 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-17 22:06:30,260 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-17 22:06:30,261 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-17 22:06:30,262 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-17 22:06:30,264 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-17 22:06:30,265 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-17 22:06:30,267 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-17 22:06:30,269 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-17 22:06:30,270 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-17 22:06:30,272 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-17 22:06:30,274 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-17 22:06:30,277 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-17 22:06:30,279 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-17 22:06:30,280 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-17 22:06:30,281 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-17 22:06:30,284 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-17 22:06:30,284 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-17 22:06:30,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-17 22:06:30,285 INFO L280 TraceCheckUtils]: 24: Hoare triple {1634#false} ~cond := #in~cond; {1634#false} is VALID [2020-07-17 22:06:30,285 INFO L280 TraceCheckUtils]: 25: Hoare triple {1634#false} assume 0 == ~cond; {1634#false} is VALID [2020-07-17 22:06:30,285 INFO L280 TraceCheckUtils]: 26: Hoare triple {1634#false} assume !false; {1634#false} is VALID [2020-07-17 22:06:30,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-17 22:06:30,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:06:30,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-07-17 22:06:30,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780924651] [2020-07-17 22:06:30,288 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-07-17 22:06:30,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:30,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-17 22:06:30,364 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-17 22:06:30,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 22:06:30,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:30,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 22:06:30,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=175, Unknown=2, NotChecked=0, Total=210 [2020-07-17 22:06:30,365 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 15 states. [2020-07-17 22:06:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:37,642 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2020-07-17 22:06:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:06:37,642 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-07-17 22:06:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:06:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2020-07-17 22:06:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:06:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2020-07-17 22:06:37,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 59 transitions. [2020-07-17 22:06:37,801 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-17 22:06:37,803 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:06:37,803 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:06:37,804 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=44, Invalid=226, Unknown=2, NotChecked=0, Total=272 [2020-07-17 22:06:37,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:06:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 22:06:37,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:37,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-17 22:06:37,843 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:06:37,843 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:06:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:37,845 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:06:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:06:37,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:37,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:37,846 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:06:37,846 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:06:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:37,848 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:06:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:06:37,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:37,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:37,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:37,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:06:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-17 22:06:37,851 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2020-07-17 22:06:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:37,851 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-17 22:06:37,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 22:06:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:06:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-17 22:06:37,852 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:37,852 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-17 22:06:38,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:06:38,066 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:38,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1878386625, now seen corresponding path program 4 times [2020-07-17 22:06:38,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:38,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924127540] [2020-07-17 22:06:38,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:38,081 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:06:38,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1138125366] [2020-07-17 22:06:38,082 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-17 22:06:38,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:06:38,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:06:38,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-17 22:06:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:38,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:38,668 INFO L263 TraceCheckUtils]: 0: Hoare triple {1945#true} call ULTIMATE.init(); {1945#true} is VALID [2020-07-17 22:06:38,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {1945#true} assume true; {1945#true} is VALID [2020-07-17 22:06:38,669 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1945#true} {1945#true} #61#return; {1945#true} is VALID [2020-07-17 22:06:38,669 INFO L263 TraceCheckUtils]: 3: Hoare triple {1945#true} call #t~ret1 := main(); {1945#true} is VALID [2020-07-17 22:06:38,671 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-17 22:06:38,672 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-17 22:06:38,672 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-17 22:06:38,673 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-17 22:06:38,674 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-17 22:06:38,674 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-17 22:06:38,675 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-17 22:06:38,680 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-17 22:06:38,683 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-17 22:06:38,684 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-17 22:06:38,685 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-17 22:06:38,687 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-17 22:06:38,687 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-17 22:06:38,689 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-17 22:06:38,691 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-17 22:06:38,693 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-17 22:06:38,694 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-17 22:06:38,695 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-17 22:06:38,696 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-17 22:06:38,697 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-17 22:06:38,697 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-17 22:06:38,698 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-17 22:06:38,699 INFO L280 TraceCheckUtils]: 26: Hoare triple {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:06:38,700 INFO L280 TraceCheckUtils]: 27: Hoare triple {2040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1946#false} is VALID [2020-07-17 22:06:38,700 INFO L280 TraceCheckUtils]: 28: Hoare triple {1946#false} assume !false; {1946#false} is VALID [2020-07-17 22:06:38,701 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-17 22:06:38,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924127540] [2020-07-17 22:06:38,702 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:06:38,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138125366] [2020-07-17 22:06:38,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:06:38,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-17 22:06:38,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476800428] [2020-07-17 22:06:38,703 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2020-07-17 22:06:38,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:38,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-17 22:06:38,761 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-17 22:06:38,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 22:06:38,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:38,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 22:06:38,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:06:38,763 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 15 states. [2020-07-17 22:06:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:40,446 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-07-17 22:06:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:06:40,446 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2020-07-17 22:06:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:06:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:06:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2020-07-17 22:06:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:06:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2020-07-17 22:06:40,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 57 transitions. [2020-07-17 22:06:40,566 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-17 22:06:40,570 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:06:40,570 INFO L226 Difference]: Without dead ends: 49 [2020-07-17 22:06:40,571 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:06:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-17 22:06:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2020-07-17 22:06:40,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:06:40,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2020-07-17 22:06:40,648 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2020-07-17 22:06:40,648 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2020-07-17 22:06:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:40,650 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-17 22:06:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2020-07-17 22:06:40,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:40,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:40,651 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2020-07-17 22:06:40,651 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2020-07-17 22:06:40,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:06:40,653 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-17 22:06:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2020-07-17 22:06:40,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:06:40,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:06:40,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:06:40,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:06:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-17 22:06:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2020-07-17 22:06:40,656 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 29 [2020-07-17 22:06:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:06:40,657 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2020-07-17 22:06:40,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 22:06:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2020-07-17 22:06:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:06:40,658 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:06:40,658 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-17 22:06:40,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-17 22:06:40,872 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:06:40,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:06:40,873 INFO L82 PathProgramCache]: Analyzing trace with hash 841482334, now seen corresponding path program 5 times [2020-07-17 22:06:40,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:06:40,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133358584] [2020-07-17 22:06:40,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:06:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:40,955 INFO L280 TraceCheckUtils]: 0: Hoare triple {2293#true} assume true; {2293#true} is VALID [2020-07-17 22:06:40,955 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2293#true} {2293#true} #61#return; {2293#true} is VALID [2020-07-17 22:06:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,318 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-17 22:06:41,319 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-17 22:06:41,322 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-17 22:06:41,325 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-17 22:06:41,327 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-17 22:06:41,328 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-17 22:06:41,329 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-17 22:06:41,331 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-17 22:06:41,332 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-17 22:06:41,333 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-17 22:06:41,334 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-17 22:06:41,336 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-17 22:06:41,337 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-17 22:06:41,339 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-17 22:06:41,339 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-17 22:06:41,341 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-17 22:06:41,341 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-17 22:06:41,342 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-17 22:06:41,342 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-17 22:06:41,344 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-17 22:06:41,347 INFO L263 TraceCheckUtils]: 0: Hoare triple {2293#true} call ULTIMATE.init(); {2293#true} is VALID [2020-07-17 22:06:41,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {2293#true} assume true; {2293#true} is VALID [2020-07-17 22:06:41,347 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2293#true} {2293#true} #61#return; {2293#true} is VALID [2020-07-17 22:06:41,347 INFO L263 TraceCheckUtils]: 3: Hoare triple {2293#true} call #t~ret1 := main(); {2293#true} is VALID [2020-07-17 22:06:41,348 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-17 22:06:41,348 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-17 22:06:41,349 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-17 22:06:41,350 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-17 22:06:41,351 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-17 22:06:41,351 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-17 22:06:41,352 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-17 22:06:41,353 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-17 22:06:41,354 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-17 22:06:41,355 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-17 22:06:41,356 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-17 22:06:41,358 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-17 22:06:41,359 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-17 22:06:41,360 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-17 22:06:41,361 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-17 22:06:41,362 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-17 22:06:41,363 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-17 22:06:41,365 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-17 22:06:41,366 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-17 22:06:41,366 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-17 22:06:41,367 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-17 22:06:41,368 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-17 22:06:41,368 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-17 22:06:41,369 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-17 22:06:41,369 INFO L280 TraceCheckUtils]: 28: Hoare triple {2294#false} ~cond := #in~cond; {2294#false} is VALID [2020-07-17 22:06:41,369 INFO L280 TraceCheckUtils]: 29: Hoare triple {2294#false} assume 0 == ~cond; {2294#false} is VALID [2020-07-17 22:06:41,369 INFO L280 TraceCheckUtils]: 30: Hoare triple {2294#false} assume !false; {2294#false} is VALID [2020-07-17 22:06:41,372 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-17 22:06:41,372 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133358584] [2020-07-17 22:06:41,372 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630636092] [2020-07-17 22:06:41,372 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-17 22:06:41,404 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2020-07-17 22:06:41,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:06:41,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-17 22:06:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:06:41,420 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:06:52,533 INFO L263 TraceCheckUtils]: 0: Hoare triple {2293#true} call ULTIMATE.init(); {2293#true} is VALID [2020-07-17 22:06:52,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {2293#true} assume true; {2293#true} is VALID [2020-07-17 22:06:52,533 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2293#true} {2293#true} #61#return; {2293#true} is VALID [2020-07-17 22:06:52,533 INFO L263 TraceCheckUtils]: 3: Hoare triple {2293#true} call #t~ret1 := main(); {2293#true} is VALID [2020-07-17 22:06:52,536 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-17 22:06:52,536 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-17 22:06:52,537 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-17 22:06:52,538 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-17 22:06:52,538 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-17 22:06:52,539 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-17 22:06:52,540 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-17 22:06:52,542 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-17 22:06:52,543 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-17 22:06:52,545 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-17 22:06:52,546 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-17 22:06:52,547 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-17 22:06:52,548 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-17 22:06:52,551 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-17 22:06:52,552 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-17 22:06:52,555 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-17 22:06:52,556 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-17 22:06:52,560 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-17 22:06:52,561 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-17 22:06:52,561 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-17 22:06:52,562 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-17 22:06:52,565 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-17 22:06:52,565 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-17 22:06:52,565 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-17 22:06:52,566 INFO L280 TraceCheckUtils]: 28: Hoare triple {2294#false} ~cond := #in~cond; {2294#false} is VALID [2020-07-17 22:06:52,566 INFO L280 TraceCheckUtils]: 29: Hoare triple {2294#false} assume 0 == ~cond; {2294#false} is VALID [2020-07-17 22:06:52,566 INFO L280 TraceCheckUtils]: 30: Hoare triple {2294#false} assume !false; {2294#false} is VALID [2020-07-17 22:06:52,569 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-17 22:06:52,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:06:52,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2020-07-17 22:06:52,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996911600] [2020-07-17 22:06:52,570 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2020-07-17 22:06:52,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:06:52,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-17 22:06:52,696 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-17 22:06:52,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-17 22:06:52,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:06:52,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-17 22:06:52,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=397, Unknown=5, NotChecked=0, Total=462 [2020-07-17 22:06:52,698 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 22 states. [2020-07-17 22:07:59,097 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 42 [2020-07-17 22:08:18,222 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-17 22:08:28,797 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 40 [2020-07-17 22:08:34,199 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 43 [2020-07-17 22:08:49,435 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-17 22:10:10,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:10:10,295 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2020-07-17 22:10:10,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 22:10:10,295 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2020-07-17 22:10:10,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:10:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:10:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2020-07-17 22:10:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:10:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 82 transitions. [2020-07-17 22:10:10,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 82 transitions. [2020-07-17 22:10:11,268 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-17 22:10:11,270 INFO L225 Difference]: With dead ends: 79 [2020-07-17 22:10:11,270 INFO L226 Difference]: Without dead ends: 46 [2020-07-17 22:10:11,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=135, Invalid=774, Unknown=21, NotChecked=0, Total=930 [2020-07-17 22:10:11,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-17 22:10:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-17 22:10:11,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:10:11,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2020-07-17 22:10:11,525 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-17 22:10:11,525 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-17 22:10:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:10:11,528 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-17 22:10:11,528 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-17 22:10:11,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:10:11,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:10:11,529 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2020-07-17 22:10:11,529 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2020-07-17 22:10:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:10:11,531 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-17 22:10:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-17 22:10:11,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:10:11,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:10:11,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:10:11,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:10:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-17 22:10:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-17 22:10:11,534 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2020-07-17 22:10:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:10:11,534 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-17 22:10:11,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-17 22:10:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-17 22:10:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:10:11,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:10:11,535 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-17 22:10:11,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:10:11,737 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:10:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:10:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1492674782, now seen corresponding path program 6 times [2020-07-17 22:10:11,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:10:11,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891690803] [2020-07-17 22:10:11,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:10:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:11,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {2715#true} assume true; {2715#true} is VALID [2020-07-17 22:10:11,791 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2715#true} {2715#true} #61#return; {2715#true} is VALID [2020-07-17 22:10:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:11,867 INFO L280 TraceCheckUtils]: 0: Hoare triple {2715#true} ~a := #in~a;~b := #in~b; {2715#true} is VALID [2020-07-17 22:10:11,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {2715#true} assume !(~a < 0); {2715#true} is VALID [2020-07-17 22:10:11,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {2715#true} assume !(~b < 0); {2715#true} is VALID [2020-07-17 22:10:11,868 INFO L280 TraceCheckUtils]: 3: Hoare triple {2715#true} assume !(0 == ~a); {2715#true} is VALID [2020-07-17 22:10:11,868 INFO L280 TraceCheckUtils]: 4: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,868 INFO L280 TraceCheckUtils]: 5: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-17 22:10:11,869 INFO L280 TraceCheckUtils]: 6: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,869 INFO L280 TraceCheckUtils]: 7: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-17 22:10:11,869 INFO L280 TraceCheckUtils]: 8: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,869 INFO L280 TraceCheckUtils]: 9: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-17 22:10:11,869 INFO L280 TraceCheckUtils]: 10: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,870 INFO L280 TraceCheckUtils]: 11: Hoare triple {2715#true} assume !(~a > ~b);~b := ~b - ~a; {2715#true} is VALID [2020-07-17 22:10:11,870 INFO L280 TraceCheckUtils]: 12: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,870 INFO L280 TraceCheckUtils]: 13: Hoare triple {2715#true} assume !(~a > ~b);~b := ~b - ~a; {2715#true} is VALID [2020-07-17 22:10:11,874 INFO L280 TraceCheckUtils]: 14: Hoare triple {2715#true} assume !!(0 != ~b); {2739#(not (= gcd_test_~b 0))} is VALID [2020-07-17 22:10:11,877 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-17 22:10:11,881 INFO L280 TraceCheckUtils]: 16: Hoare triple {2739#(not (= gcd_test_~b 0))} assume !(0 != ~b); {2716#false} is VALID [2020-07-17 22:10:11,881 INFO L280 TraceCheckUtils]: 17: Hoare triple {2716#false} #res := ~a; {2716#false} is VALID [2020-07-17 22:10:11,882 INFO L280 TraceCheckUtils]: 18: Hoare triple {2716#false} assume true; {2716#false} is VALID [2020-07-17 22:10:11,882 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {2716#false} {2715#true} #65#return; {2716#false} is VALID [2020-07-17 22:10:11,883 INFO L263 TraceCheckUtils]: 0: Hoare triple {2715#true} call ULTIMATE.init(); {2715#true} is VALID [2020-07-17 22:10:11,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {2715#true} assume true; {2715#true} is VALID [2020-07-17 22:10:11,883 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2715#true} {2715#true} #61#return; {2715#true} is VALID [2020-07-17 22:10:11,883 INFO L263 TraceCheckUtils]: 3: Hoare triple {2715#true} call #t~ret1 := main(); {2715#true} is VALID [2020-07-17 22:10:11,883 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-17 22:10:11,884 INFO L263 TraceCheckUtils]: 5: Hoare triple {2715#true} call #t~ret0 := gcd_test(~x~0, ~y~0); {2715#true} is VALID [2020-07-17 22:10:11,884 INFO L280 TraceCheckUtils]: 6: Hoare triple {2715#true} ~a := #in~a;~b := #in~b; {2715#true} is VALID [2020-07-17 22:10:11,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {2715#true} assume !(~a < 0); {2715#true} is VALID [2020-07-17 22:10:11,884 INFO L280 TraceCheckUtils]: 8: Hoare triple {2715#true} assume !(~b < 0); {2715#true} is VALID [2020-07-17 22:10:11,885 INFO L280 TraceCheckUtils]: 9: Hoare triple {2715#true} assume !(0 == ~a); {2715#true} is VALID [2020-07-17 22:10:11,885 INFO L280 TraceCheckUtils]: 10: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,885 INFO L280 TraceCheckUtils]: 11: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-17 22:10:11,885 INFO L280 TraceCheckUtils]: 12: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,885 INFO L280 TraceCheckUtils]: 13: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-17 22:10:11,886 INFO L280 TraceCheckUtils]: 14: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,886 INFO L280 TraceCheckUtils]: 15: Hoare triple {2715#true} assume ~a > ~b;~a := ~a - ~b; {2715#true} is VALID [2020-07-17 22:10:11,886 INFO L280 TraceCheckUtils]: 16: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,886 INFO L280 TraceCheckUtils]: 17: Hoare triple {2715#true} assume !(~a > ~b);~b := ~b - ~a; {2715#true} is VALID [2020-07-17 22:10:11,886 INFO L280 TraceCheckUtils]: 18: Hoare triple {2715#true} assume !!(0 != ~b); {2715#true} is VALID [2020-07-17 22:10:11,887 INFO L280 TraceCheckUtils]: 19: Hoare triple {2715#true} assume !(~a > ~b);~b := ~b - ~a; {2715#true} is VALID [2020-07-17 22:10:11,906 INFO L280 TraceCheckUtils]: 20: Hoare triple {2715#true} assume !!(0 != ~b); {2739#(not (= gcd_test_~b 0))} is VALID [2020-07-17 22:10:11,910 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-17 22:10:11,913 INFO L280 TraceCheckUtils]: 22: Hoare triple {2739#(not (= gcd_test_~b 0))} assume !(0 != ~b); {2716#false} is VALID [2020-07-17 22:10:11,914 INFO L280 TraceCheckUtils]: 23: Hoare triple {2716#false} #res := ~a; {2716#false} is VALID [2020-07-17 22:10:11,914 INFO L280 TraceCheckUtils]: 24: Hoare triple {2716#false} assume true; {2716#false} is VALID [2020-07-17 22:10:11,914 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {2716#false} {2715#true} #65#return; {2716#false} is VALID [2020-07-17 22:10:11,915 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-17 22:10:11,915 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-17 22:10:11,915 INFO L280 TraceCheckUtils]: 28: Hoare triple {2716#false} ~cond := #in~cond; {2716#false} is VALID [2020-07-17 22:10:11,915 INFO L280 TraceCheckUtils]: 29: Hoare triple {2716#false} assume 0 == ~cond; {2716#false} is VALID [2020-07-17 22:10:11,915 INFO L280 TraceCheckUtils]: 30: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2020-07-17 22:10:11,916 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-17 22:10:11,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891690803] [2020-07-17 22:10:11,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:10:11,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:10:11,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980695797] [2020-07-17 22:10:11,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-17 22:10:11,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:10:11,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:10:12,119 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-17 22:10:12,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:10:12,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:10:12,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:10:12,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:10:12,121 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 3 states. [2020-07-17 22:10:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:10:12,671 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2020-07-17 22:10:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:10:12,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-17 22:10:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:10:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:10:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2020-07-17 22:10:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:10:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2020-07-17 22:10:12,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 44 transitions. [2020-07-17 22:10:13,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:10:13,046 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:10:13,047 INFO L226 Difference]: Without dead ends: 47 [2020-07-17 22:10:13,047 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-17 22:10:13,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-17 22:10:13,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-17 22:10:13,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:10:13,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2020-07-17 22:10:13,323 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-17 22:10:13,323 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-17 22:10:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:10:13,325 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-17 22:10:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-17 22:10:13,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:10:13,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:10:13,326 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2020-07-17 22:10:13,326 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2020-07-17 22:10:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:10:13,328 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-17 22:10:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-17 22:10:13,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:10:13,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:10:13,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:10:13,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:10:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 22:10:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2020-07-17 22:10:13,330 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 31 [2020-07-17 22:10:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:10:13,331 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2020-07-17 22:10:13,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:10:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2020-07-17 22:10:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:10:13,332 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:10:13,332 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-17 22:10:13,332 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:10:13,332 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:10:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:10:13,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1099647772, now seen corresponding path program 7 times [2020-07-17 22:10:13,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:10:13,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169476593] [2020-07-17 22:10:13,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:10:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:13,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {2989#true} assume true; {2989#true} is VALID [2020-07-17 22:10:13,446 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2989#true} {2989#true} #61#return; {2989#true} is VALID [2020-07-17 22:10:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:14,181 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-17 22:10:14,184 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-17 22:10:14,188 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-17 22:10:14,191 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-17 22:10:14,195 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-17 22:10:14,202 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-17 22:10:14,206 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-17 22:10:14,211 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-17 22:10:14,215 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-17 22:10:14,219 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-17 22:10:14,222 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-17 22:10:14,227 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-17 22:10:14,230 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-17 22:10:14,235 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-17 22:10:14,238 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-17 22:10:14,242 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-17 22:10:14,245 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-17 22:10:14,248 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-17 22:10:14,251 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-17 22:10:14,255 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-17 22:10:14,257 INFO L263 TraceCheckUtils]: 0: Hoare triple {2989#true} call ULTIMATE.init(); {2989#true} is VALID [2020-07-17 22:10:14,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {2989#true} assume true; {2989#true} is VALID [2020-07-17 22:10:14,258 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2989#true} {2989#true} #61#return; {2989#true} is VALID [2020-07-17 22:10:14,258 INFO L263 TraceCheckUtils]: 3: Hoare triple {2989#true} call #t~ret1 := main(); {2989#true} is VALID [2020-07-17 22:10:14,264 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-17 22:10:14,264 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-17 22:10:14,268 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-17 22:10:14,271 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-17 22:10:14,274 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-17 22:10:14,278 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-17 22:10:14,281 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-17 22:10:14,284 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-17 22:10:14,287 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-17 22:10:14,292 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-17 22:10:14,296 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-17 22:10:14,301 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-17 22:10:14,304 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-17 22:10:14,308 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-17 22:10:14,312 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-17 22:10:14,316 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-17 22:10:14,320 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-17 22:10:14,326 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-17 22:10:14,332 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-17 22:10:14,336 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-17 22:10:14,339 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-17 22:10:14,343 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-17 22:10:14,344 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-17 22:10:14,344 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-17 22:10:14,344 INFO L280 TraceCheckUtils]: 28: Hoare triple {2990#false} ~cond := #in~cond; {2990#false} is VALID [2020-07-17 22:10:14,344 INFO L280 TraceCheckUtils]: 29: Hoare triple {2990#false} assume 0 == ~cond; {2990#false} is VALID [2020-07-17 22:10:14,344 INFO L280 TraceCheckUtils]: 30: Hoare triple {2990#false} assume !false; {2990#false} is VALID [2020-07-17 22:10:14,346 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-17 22:10:14,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169476593] [2020-07-17 22:10:14,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839624249] [2020-07-17 22:10:14,347 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-17 22:10:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:14,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-17 22:10:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:14,399 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:10:20,512 INFO L263 TraceCheckUtils]: 0: Hoare triple {2989#true} call ULTIMATE.init(); {2989#true} is VALID [2020-07-17 22:10:20,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {2989#true} assume true; {2989#true} is VALID [2020-07-17 22:10:20,513 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2989#true} {2989#true} #61#return; {2989#true} is VALID [2020-07-17 22:10:20,513 INFO L263 TraceCheckUtils]: 3: Hoare triple {2989#true} call #t~ret1 := main(); {2989#true} is VALID [2020-07-17 22:10:20,516 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-17 22:10:20,517 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-17 22:10:20,520 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-17 22:10:20,523 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-17 22:10:20,527 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-17 22:10:20,530 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-17 22:10:20,534 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-17 22:10:20,539 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-17 22:10:20,542 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-17 22:10:20,546 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-17 22:10:20,550 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-17 22:10:20,555 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-17 22:10:20,558 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-17 22:10:20,567 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-17 22:10:20,570 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-17 22:10:20,576 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-17 22:10:20,579 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-17 22:10:20,609 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-17 22:10:20,613 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-17 22:10:20,622 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-17 22:10:20,625 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-17 22:10:20,631 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-17 22:10:20,632 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-17 22:10:20,632 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-17 22:10:20,632 INFO L280 TraceCheckUtils]: 28: Hoare triple {2990#false} ~cond := #in~cond; {2990#false} is VALID [2020-07-17 22:10:20,632 INFO L280 TraceCheckUtils]: 29: Hoare triple {2990#false} assume 0 == ~cond; {2990#false} is VALID [2020-07-17 22:10:20,632 INFO L280 TraceCheckUtils]: 30: Hoare triple {2990#false} assume !false; {2990#false} is VALID [2020-07-17 22:10:20,634 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-17 22:10:20,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:10:20,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2020-07-17 22:10:20,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900435658] [2020-07-17 22:10:20,635 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-07-17 22:10:20,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:10:20,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-17 22:10:21,163 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-17 22:10:21,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 22:10:21,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:10:21,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 22:10:21,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=298, Unknown=1, NotChecked=0, Total=342 [2020-07-17 22:10:21,165 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 19 states. [2020-07-17 22:10:22,403 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2020-07-17 22:10:29,220 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2020-07-17 22:10:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:10:38,661 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2020-07-17 22:10:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-17 22:10:38,662 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-07-17 22:10:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:10:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:10:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2020-07-17 22:10:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:10:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2020-07-17 22:10:38,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 77 transitions. [2020-07-17 22:10:39,635 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-17 22:10:39,636 INFO L225 Difference]: With dead ends: 73 [2020-07-17 22:10:39,637 INFO L226 Difference]: Without dead ends: 48 [2020-07-17 22:10:39,641 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=98, Invalid=551, Unknown=1, NotChecked=0, Total=650 [2020-07-17 22:10:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-17 22:10:39,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-17 22:10:39,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:10:39,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2020-07-17 22:10:39,982 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-17 22:10:39,983 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-17 22:10:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:10:39,984 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-17 22:10:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-17 22:10:39,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:10:39,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:10:39,985 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2020-07-17 22:10:39,985 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2020-07-17 22:10:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:10:39,987 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-17 22:10:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-17 22:10:39,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:10:39,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:10:39,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:10:39,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:10:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-17 22:10:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-17 22:10:39,990 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 31 [2020-07-17 22:10:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:10:39,991 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-17 22:10:39,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 22:10:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-17 22:10:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 22:10:39,991 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:10:39,992 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-17 22:10:40,202 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:10:40,203 INFO L427 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:10:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:10:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash -202245895, now seen corresponding path program 8 times [2020-07-17 22:10:40,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:10:40,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924109172] [2020-07-17 22:10:40,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:10:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:40,341 INFO L280 TraceCheckUtils]: 0: Hoare triple {3404#true} assume true; {3404#true} is VALID [2020-07-17 22:10:40,341 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3404#true} {3404#true} #61#return; {3404#true} is VALID [2020-07-17 22:10:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:40,664 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2020-07-17 22:10:41,566 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-17 22:10:41,569 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-17 22:10:41,573 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-17 22:10:41,576 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-17 22:10:41,579 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-17 22:10:41,583 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-17 22:10:41,586 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-17 22:10:41,591 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-17 22:10:41,595 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-17 22:10:41,599 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-17 22:10:41,603 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-17 22:10:41,607 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-17 22:10:41,611 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-17 22:10:41,616 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-17 22:10:41,619 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-17 22:10:41,624 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-17 22:10:41,628 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-17 22:10:41,632 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-17 22:10:41,635 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-17 22:10:41,639 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-17 22:10:41,643 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-17 22:10:41,647 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-17 22:10:41,649 INFO L263 TraceCheckUtils]: 0: Hoare triple {3404#true} call ULTIMATE.init(); {3404#true} is VALID [2020-07-17 22:10:41,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {3404#true} assume true; {3404#true} is VALID [2020-07-17 22:10:41,650 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3404#true} {3404#true} #61#return; {3404#true} is VALID [2020-07-17 22:10:41,650 INFO L263 TraceCheckUtils]: 3: Hoare triple {3404#true} call #t~ret1 := main(); {3404#true} is VALID [2020-07-17 22:10:41,653 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-17 22:10:41,653 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-17 22:10:41,657 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-17 22:10:41,660 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-17 22:10:41,664 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-17 22:10:41,667 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-17 22:10:41,671 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-17 22:10:41,675 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-17 22:10:41,678 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-17 22:10:41,684 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-17 22:10:41,687 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-17 22:10:41,692 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-17 22:10:41,695 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-17 22:10:41,705 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-17 22:10:41,709 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-17 22:10:41,714 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-17 22:10:41,718 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-17 22:10:41,723 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-17 22:10:41,727 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-17 22:10:41,732 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-17 22:10:41,735 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-17 22:10:41,738 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-17 22:10:41,742 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-17 22:10:41,746 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-17 22:10:41,746 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-17 22:10:41,747 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-17 22:10:41,747 INFO L280 TraceCheckUtils]: 30: Hoare triple {3405#false} ~cond := #in~cond; {3405#false} is VALID [2020-07-17 22:10:41,747 INFO L280 TraceCheckUtils]: 31: Hoare triple {3405#false} assume 0 == ~cond; {3405#false} is VALID [2020-07-17 22:10:41,747 INFO L280 TraceCheckUtils]: 32: Hoare triple {3405#false} assume !false; {3405#false} is VALID [2020-07-17 22:10:41,749 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-17 22:10:41,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924109172] [2020-07-17 22:10:41,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195963822] [2020-07-17 22:10:41,750 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-17 22:10:41,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:10:41,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:10:41,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 22:10:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:10:41,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:10:53,253 INFO L263 TraceCheckUtils]: 0: Hoare triple {3404#true} call ULTIMATE.init(); {3404#true} is VALID [2020-07-17 22:10:53,254 INFO L280 TraceCheckUtils]: 1: Hoare triple {3404#true} assume true; {3404#true} is VALID [2020-07-17 22:10:53,254 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3404#true} {3404#true} #61#return; {3404#true} is VALID [2020-07-17 22:10:53,254 INFO L263 TraceCheckUtils]: 3: Hoare triple {3404#true} call #t~ret1 := main(); {3404#true} is VALID [2020-07-17 22:10:53,257 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-17 22:10:53,257 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-17 22:10:53,260 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-17 22:10:53,263 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-17 22:10:53,266 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-17 22:10:53,269 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-17 22:10:53,272 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-17 22:10:53,277 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-17 22:10:53,281 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-17 22:10:53,291 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-17 22:10:53,297 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-17 22:10:53,302 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-17 22:10:53,305 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-17 22:10:53,315 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-17 22:10:53,319 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-17 22:10:53,327 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-17 22:10:53,330 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-17 22:10:53,340 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-17 22:10:53,343 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-17 22:10:53,352 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-17 22:10:53,360 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-17 22:10:53,363 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-17 22:10:53,366 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-17 22:10:53,374 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-17 22:10:53,374 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-17 22:10:53,374 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-17 22:10:53,374 INFO L280 TraceCheckUtils]: 30: Hoare triple {3405#false} ~cond := #in~cond; {3405#false} is VALID [2020-07-17 22:10:53,375 INFO L280 TraceCheckUtils]: 31: Hoare triple {3405#false} assume 0 == ~cond; {3405#false} is VALID [2020-07-17 22:10:53,375 INFO L280 TraceCheckUtils]: 32: Hoare triple {3405#false} assume !false; {3405#false} is VALID [2020-07-17 22:10:53,377 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-17 22:10:53,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:10:53,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2020-07-17 22:10:53,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329423099] [2020-07-17 22:10:53,379 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2020-07-17 22:10:53,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:10:53,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-17 22:10:53,977 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-17 22:10:53,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-17 22:10:53,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:10:53,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-17 22:10:53,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=437, Unknown=2, NotChecked=0, Total=506 [2020-07-17 22:10:53,978 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 23 states. [2020-07-17 22:10:54,874 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2020-07-17 22:11:06,018 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-07-17 22:11:09,198 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2020-07-17 22:11:12,758 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2020-07-17 22:11:26,633 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2020-07-17 22:11:28,135 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-07-17 22:11:44,400 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 38 [2020-07-17 22:11:48,574 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-07-17 22:11:54,260 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-07-17 22:12:06,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:12:06,078 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2020-07-17 22:12:06,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-07-17 22:12:06,078 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2020-07-17 22:12:06,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:12:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:12:06,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 89 transitions. [2020-07-17 22:12:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:12:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 89 transitions. [2020-07-17 22:12:06,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 89 transitions. [2020-07-17 22:12:07,510 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-17 22:12:07,511 INFO L225 Difference]: With dead ends: 80 [2020-07-17 22:12:07,511 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:12:07,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=150, Invalid=1036, Unknown=4, NotChecked=0, Total=1190 [2020-07-17 22:12:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:12:07,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-17 22:12:07,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:12:07,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-17 22:12:07,835 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:12:07,835 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:12:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:12:07,837 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2020-07-17 22:12:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2020-07-17 22:12:07,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:12:07,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:12:07,837 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-17 22:12:07,837 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-17 22:12:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:12:07,839 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2020-07-17 22:12:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2020-07-17 22:12:07,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:12:07,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:12:07,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:12:07,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:12:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-17 22:12:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2020-07-17 22:12:07,841 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 33 [2020-07-17 22:12:07,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:12:07,841 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2020-07-17 22:12:07,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-17 22:12:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2020-07-17 22:12:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:12:07,842 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:12:07,842 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-17 22:12:08,051 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-17 22:12:08,052 INFO L427 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:12:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:12:08,053 INFO L82 PathProgramCache]: Analyzing trace with hash -825201876, now seen corresponding path program 1 times [2020-07-17 22:12:08,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:12:08,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479266524] [2020-07-17 22:12:08,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:12:08,065 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:12:08,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591695088] [2020-07-17 22:12:08,066 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-17 22:12:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:12:08,097 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 27 conjunts are in the unsatisfiable core [2020-07-17 22:12:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:12:08,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:12:10,125 INFO L263 TraceCheckUtils]: 0: Hoare triple {3805#true} call ULTIMATE.init(); {3805#true} is VALID [2020-07-17 22:12:10,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {3805#true} assume true; {3805#true} is VALID [2020-07-17 22:12:10,126 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3805#true} {3805#true} #61#return; {3805#true} is VALID [2020-07-17 22:12:10,126 INFO L263 TraceCheckUtils]: 3: Hoare triple {3805#true} call #t~ret1 := main(); {3805#true} is VALID [2020-07-17 22:12:10,130 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-17 22:12:10,131 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-17 22:12:10,133 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-17 22:12:10,137 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-17 22:12:10,141 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-17 22:12:10,144 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-17 22:12:10,148 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-17 22:12:10,151 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-17 22:12:10,155 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-17 22:12:10,161 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-17 22:12:10,164 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-17 22:12:10,169 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-17 22:12:10,172 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-17 22:12:10,176 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-17 22:12:10,179 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-17 22:12:10,183 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-17 22:12:10,187 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-17 22:12:10,190 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-17 22:12:10,193 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-17 22:12:10,197 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-17 22:12:10,201 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-17 22:12:10,202 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-17 22:12:10,202 INFO L280 TraceCheckUtils]: 26: Hoare triple {3805#true} ~cond := #in~cond; {3805#true} is VALID [2020-07-17 22:12:10,202 INFO L280 TraceCheckUtils]: 27: Hoare triple {3805#true} assume !(0 == ~cond); {3805#true} is VALID [2020-07-17 22:12:10,202 INFO L280 TraceCheckUtils]: 28: Hoare triple {3805#true} assume true; {3805#true} is VALID [2020-07-17 22:12:10,206 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-17 22:12:10,210 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-17 22:12:10,213 INFO L280 TraceCheckUtils]: 31: Hoare triple {3908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:12:10,217 INFO L280 TraceCheckUtils]: 32: Hoare triple {3912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3806#false} is VALID [2020-07-17 22:12:10,217 INFO L280 TraceCheckUtils]: 33: Hoare triple {3806#false} assume !false; {3806#false} is VALID [2020-07-17 22:12:10,219 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-17 22:12:10,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479266524] [2020-07-17 22:12:10,219 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:12:10,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591695088] [2020-07-17 22:12:10,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:12:10,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-17 22:12:10,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321886674] [2020-07-17 22:12:10,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-17 22:12:10,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:12:10,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-17 22:12:10,630 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-17 22:12:10,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 22:12:10,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:12:10,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 22:12:10,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-07-17 22:12:10,632 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand 12 states. [2020-07-17 22:12:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:12:17,368 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2020-07-17 22:12:17,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 22:12:17,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2020-07-17 22:12:17,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:12:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:12:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2020-07-17 22:12:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-17 22:12:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 31 transitions. [2020-07-17 22:12:17,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 31 transitions. [2020-07-17 22:12:17,870 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-17 22:12:17,871 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:12:17,871 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:12:17,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:12:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:12:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:12:17,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:12:17,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:12:17,872 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:12:17,873 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:12:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:12:17,873 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:12:17,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:12:17,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:12:17,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:12:17,873 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:12:17,873 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:12:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:12:17,873 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:12:17,874 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:12:17,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:12:17,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:12:17,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:12:17,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:12:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:12:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:12:17,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-17 22:12:17,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:12:17,874 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:12:17,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 22:12:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:12:17,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:12:18,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-17 22:12:18,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:12:18,944 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2020-07-17 22:12:19,290 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2020-07-17 22:12:19,733 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2020-07-17 22:12:19,940 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2020-07-17 22:12:34,413 WARN L193 SmtUtils]: Spent 14.43 s on a formula simplification. DAG size of input: 134 DAG size of output: 77 [2020-07-17 22:12:34,506 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:12:34,507 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:12:34,507 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:12:34,507 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:12:34,507 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:12:34,507 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:12:34,507 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 30 46) the Hoare annotation is: true [2020-07-17 22:12:34,508 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 30 46) no Hoare annotation was computed. [2020-07-17 22:12:34,508 INFO L268 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2020-07-17 22:12:34,508 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-17 22:12:34,508 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-17 22:12:34,508 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 30 46) no Hoare annotation was computed. [2020-07-17 22:12:34,508 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-17 22:12:34,508 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= 18 main_~y~0) (= 63 main_~x~0)) [2020-07-17 22:12:34,509 INFO L268 CegarLoopResult]: For program point L39-1(line 39) no Hoare annotation was computed. [2020-07-17 22:12:34,509 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2020-07-17 22:12:34,509 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-17 22:12:34,509 INFO L268 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-07-17 22:12:34,509 INFO L268 CegarLoopResult]: For program point L5(lines 5 7) no Hoare annotation was computed. [2020-07-17 22:12:34,509 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2020-07-17 22:12:34,509 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2020-07-17 22:12:34,509 INFO L268 CegarLoopResult]: For program point gcd_testEXIT(lines 10 27) no Hoare annotation was computed. [2020-07-17 22:12:34,509 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 25) no Hoare annotation was computed. [2020-07-17 22:12:34,510 INFO L268 CegarLoopResult]: For program point L13-1(lines 11 27) no Hoare annotation was computed. [2020-07-17 22:12:34,510 INFO L271 CegarLoopResult]: At program point gcd_testENTRY(lines 10 27) the Hoare annotation is: true [2020-07-17 22:12:34,510 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-07-17 22:12:34,511 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-17 22:12:34,511 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-17 22:12:34,511 INFO L268 CegarLoopResult]: For program point L12-2(lines 11 27) no Hoare annotation was computed. [2020-07-17 22:12:34,511 INFO L268 CegarLoopResult]: For program point gcd_testFINAL(lines 10 27) no Hoare annotation was computed. [2020-07-17 22:12:34,516 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:12:34,520 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:12:34,520 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-17 22:12:34,520 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-17 22:12:34,521 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:12:34,522 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: gcd_testFINAL has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: gcd_testEXIT has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-17 22:12:34,523 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:12:34,524 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-17 22:12:34,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-17 22:12:34,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-17 22:12:34,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-17 22:12:34,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-17 22:12:34,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:12:34 BoogieIcfgContainer [2020-07-17 22:12:34,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:12:34,570 INFO L168 Benchmark]: Toolchain (without parser) took 383410.02 ms. Allocated memory was 137.4 MB in the beginning and 257.4 MB in the end (delta: 120.1 MB). Free memory was 102.3 MB in the beginning and 91.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 131.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:12:34,571 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:12:34,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.86 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:12:34,572 INFO L168 Benchmark]: Boogie Preprocessor took 120.85 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 92.0 MB in the beginning and 180.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:12:34,572 INFO L168 Benchmark]: RCFGBuilder took 403.74 ms. Allocated memory is still 201.3 MB. Free memory was 180.4 MB in the beginning and 160.9 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2020-07-17 22:12:34,573 INFO L168 Benchmark]: TraceAbstraction took 382598.21 ms. Allocated memory was 201.3 MB in the beginning and 257.4 MB in the end (delta: 56.1 MB). Free memory was 160.2 MB in the beginning and 91.4 MB in the end (delta: 68.8 MB). Peak memory consumption was 124.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:12:34,575 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.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 264.86 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 120.85 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 92.0 MB in the beginning and 180.4 MB in the end (delta: -88.4 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 403.74 ms. Allocated memory is still 201.3 MB. Free memory was 180.4 MB in the beginning and 160.9 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 382598.21 ms. Allocated memory was 201.3 MB in the beginning and 257.4 MB in the end (delta: 56.1 MB). Free memory was 160.2 MB in the beginning and 91.4 MB in the end (delta: 68.8 MB). Peak memory consumption was 124.9 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-17 22:12:34,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-17 22:12:34,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-17 22:12:34,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,583 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,584 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-17 22:12:34,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[gcd_test_~a,QUANTIFIED] [2020-07-17 22:12:34,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,585 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_gcd_test_~a_30,QUANTIFIED] [2020-07-17 22:12:34,585 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: 366.0s, OverallIterations: 14, TraceHistogramMax: 7, AutomataDifference: 315.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 16.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 307 SDtfs, 267 SDslu, 1705 SDs, 0 SdLazy, 1849 SolverSat, 110 SolverUnsat, 49 SolverUnknown, 0 SolverNotchecked, 110.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 94.7s 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.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 49 PreInvPairs, 90 NumberOfFragments, 214 HoareAnnotationTreeSize, 49 FomulaSimplifications, 1067 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 11 FomulaSimplificationsInter, 412 FormulaSimplificationTreeSizeReductionInter, 15.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 43.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...