java -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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/bitvector/gcd_4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:36:17,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:36:17,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:36:17,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:36:17,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:36:17,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:36:17,822 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:36:17,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:36:17,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:36:17,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:36:17,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:36:17,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:36:17,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:36:17,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:36:17,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:36:17,843 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:36:17,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:36:17,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:36:17,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:36:17,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:36:17,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:36:17,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:36:17,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:36:17,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:36:17,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:36:17,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:36:17,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:36:17,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:36:17,858 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:36:17,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:36:17,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:36:17,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:36:17,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:36:17,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:36:17,862 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:36:17,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:36:17,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:36:17,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:36:17,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:36:17,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:36:17,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:36:17,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:36:17,881 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:36:17,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:36:17,882 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:36:17,882 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:36:17,883 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:36:17,883 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:36:17,883 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:36:17,884 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:36:17,884 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:36:17,884 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:36:17,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:36:17,885 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:36:17,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:36:17,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:36:17,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:36:17,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:36:17,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:36:17,886 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:36:17,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:36:17,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:36:17,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:36:17,887 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:36:17,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:36:17,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:36:17,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:36:17,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:36:17,888 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:36:17,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:36:17,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:36:17,889 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:36:17,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:36:17,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:36:17,935 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:36:17,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:36:17,937 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:36:17,938 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/gcd_4.c [2019-09-09 05:36:18,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae9f44a1/324714dc5e474894b8f52f5fdddff956/FLAG5f3848a9a [2019-09-09 05:36:18,545 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:36:18,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/gcd_4.c [2019-09-09 05:36:18,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae9f44a1/324714dc5e474894b8f52f5fdddff956/FLAG5f3848a9a [2019-09-09 05:36:18,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ae9f44a1/324714dc5e474894b8f52f5fdddff956 [2019-09-09 05:36:18,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:36:18,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:36:18,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:36:18,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:36:18,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:36:18,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:36:18" (1/1) ... [2019-09-09 05:36:18,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c5a42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:18, skipping insertion in model container [2019-09-09 05:36:18,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:36:18" (1/1) ... [2019-09-09 05:36:18,927 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:36:18,947 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:36:19,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:36:19,151 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:36:19,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:36:19,181 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:36:19,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19 WrapperNode [2019-09-09 05:36:19,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:36:19,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:36:19,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:36:19,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:36:19,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19" (1/1) ... [2019-09-09 05:36:19,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19" (1/1) ... [2019-09-09 05:36:19,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19" (1/1) ... [2019-09-09 05:36:19,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19" (1/1) ... [2019-09-09 05:36:19,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19" (1/1) ... [2019-09-09 05:36:19,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19" (1/1) ... [2019-09-09 05:36:19,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19" (1/1) ... [2019-09-09 05:36:19,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:36:19,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:36:19,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:36:19,320 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:36:19,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19" (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 [2019-09-09 05:36:19,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:36:19,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:36:19,376 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-09 05:36:19,377 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd_test [2019-09-09 05:36:19,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:36:19,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:36:19,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:36:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-09 05:36:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure gcd_test [2019-09-09 05:36:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:36:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:36:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:36:19,599 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:36:19,600 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:36:19,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:36:19 BoogieIcfgContainer [2019-09-09 05:36:19,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:36:19,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:36:19,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:36:19,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:36:19,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:36:18" (1/3) ... [2019-09-09 05:36:19,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77935910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:36:19, skipping insertion in model container [2019-09-09 05:36:19,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:19" (2/3) ... [2019-09-09 05:36:19,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77935910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:36:19, skipping insertion in model container [2019-09-09 05:36:19,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:36:19" (3/3) ... [2019-09-09 05:36:19,638 INFO L109 eAbstractionObserver]: Analyzing ICFG gcd_4.c [2019-09-09 05:36:19,671 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:36:19,689 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:36:19,710 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:36:19,740 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:36:19,741 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:36:19,741 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:36:19,741 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:36:19,741 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:36:19,741 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:36:19,742 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:36:19,742 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:36:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-09-09 05:36:19,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-09 05:36:19,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:19,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:19,777 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash 876608673, now seen corresponding path program 1 times [2019-09-09 05:36:19,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:19,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:19,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:19,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:19,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:19,862 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:36:19,863 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:36:19,863 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:36:19,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:19,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:36:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:19,910 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-09 05:36:19,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:36:19,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:19,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:36:19,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:19,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:36:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:19,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-09 05:36:19,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:36:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:20,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:36:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:20,186 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:20,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-09 05:36:20,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:20,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:20,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:36:20,209 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2019-09-09 05:36:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:20,335 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-09-09 05:36:20,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:20,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-09 05:36:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:20,359 INFO L225 Difference]: With dead ends: 42 [2019-09-09 05:36:20,360 INFO L226 Difference]: Without dead ends: 30 [2019-09-09 05:36:20,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:36:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-09 05:36:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-09-09 05:36:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-09 05:36:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-09-09 05:36:20,409 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2019-09-09 05:36:20,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:20,409 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-09-09 05:36:20,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-09-09 05:36:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-09 05:36:20,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:20,412 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:20,412 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash 483581663, now seen corresponding path program 1 times [2019-09-09 05:36:20,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:20,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:20,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:20,423 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:36:20,423 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:36:20,423 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:36:20,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:20,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:36:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:20,460 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-09 05:36:20,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:36:20,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:20,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:36:20,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:20,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:36:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:20,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-09 05:36:20,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:36:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:20,532 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:36:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:20,633 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:20,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-09 05:36:20,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:20,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:20,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:36:20,636 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 5 states. [2019-09-09 05:36:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:20,697 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2019-09-09 05:36:20,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:20,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-09 05:36:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:20,701 INFO L225 Difference]: With dead ends: 32 [2019-09-09 05:36:20,701 INFO L226 Difference]: Without dead ends: 30 [2019-09-09 05:36:20,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:36:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-09 05:36:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-09-09 05:36:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-09 05:36:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-09-09 05:36:20,708 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 17 [2019-09-09 05:36:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:20,709 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-09-09 05:36:20,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-09-09 05:36:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:36:20,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:20,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:20,711 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:20,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1158269966, now seen corresponding path program 1 times [2019-09-09 05:36:20,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:20,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:20,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:20,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:20,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:20,721 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:36:20,721 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:36:20,722 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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) [2019-09-09 05:36:20,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:20,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:36:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:20,755 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-09 05:36:20,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:36:20,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:20,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:36:20,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:20,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:36:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:20,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-09 05:36:20,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:36:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:20,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:36:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:20,938 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:20,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-09 05:36:20,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:20,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:20,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:36:20,940 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 5 states. [2019-09-09 05:36:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:21,012 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-09-09 05:36:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:21,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-09 05:36:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:21,014 INFO L225 Difference]: With dead ends: 36 [2019-09-09 05:36:21,014 INFO L226 Difference]: Without dead ends: 30 [2019-09-09 05:36:21,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:36:21,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-09 05:36:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-09-09 05:36:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-09 05:36:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-09 05:36:21,026 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2019-09-09 05:36:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:21,028 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-09 05:36:21,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-09 05:36:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:36:21,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:21,030 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:21,030 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash -457205388, now seen corresponding path program 1 times [2019-09-09 05:36:21,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:21,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:21,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:21,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:21,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:21,056 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:36:21,056 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:36:21,057 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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 [2019-09-09 05:36:21,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:21,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:36:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:21,080 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-09 05:36:21,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:36:21,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:21,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:36:21,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:21,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:36:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:21,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-09 05:36:21,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:36:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:21,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:36:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:21,212 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:21,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-09 05:36:21,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:21,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:21,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:21,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:36:21,214 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-09-09 05:36:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:21,276 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-09-09 05:36:21,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:21,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-09 05:36:21,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:21,278 INFO L225 Difference]: With dead ends: 30 [2019-09-09 05:36:21,278 INFO L226 Difference]: Without dead ends: 27 [2019-09-09 05:36:21,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:36:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-09 05:36:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-09 05:36:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-09 05:36:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-09-09 05:36:21,294 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2019-09-09 05:36:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:21,295 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-09-09 05:36:21,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-09-09 05:36:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:36:21,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:21,299 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:21,300 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:21,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1431348209, now seen corresponding path program 1 times [2019-09-09 05:36:21,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:21,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:21,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:21,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:21,318 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:36:21,318 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:36:21,319 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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 [2019-09-09 05:36:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:21,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:36:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:21,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2019-09-09 05:36:21,367 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [12], [15], [17], [23], [28], [34], [39], [46], [48], [53], [58], [59], [60], [61], [62], [64], [65], [66] [2019-09-09 05:36:21,418 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:36:21,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:36:21,591 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:36:21,604 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 12 root evaluator evaluations with a maximum evaluation depth of 5. Performed 12 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 5 variables. [2019-09-09 05:36:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:21,610 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:36:21,668 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 50% of their original sizes. [2019-09-09 05:36:21,669 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:36:21,681 INFO L420 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2019-09-09 05:36:21,681 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:36:21,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:21,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:36:21,682 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:21,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:21,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:21,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:21,684 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 5 states. [2019-09-09 05:36:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:21,762 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-09 05:36:21,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:21,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-09-09 05:36:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:21,764 INFO L225 Difference]: With dead ends: 29 [2019-09-09 05:36:21,764 INFO L226 Difference]: Without dead ends: 29 [2019-09-09 05:36:21,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:36:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-09 05:36:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-09 05:36:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-09 05:36:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-09 05:36:21,769 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 21 [2019-09-09 05:36:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:21,770 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-09 05:36:21,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-09 05:36:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:36:21,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:21,771 INFO L399 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] [2019-09-09 05:36:21,772 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1537894100, now seen corresponding path program 1 times [2019-09-09 05:36:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:21,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:21,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:21,780 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:36:21,781 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:36:21,781 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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) [2019-09-09 05:36:21,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:21,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:36:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:21,818 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2019-09-09 05:36:21,818 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [12], [15], [17], [23], [28], [34], [39], [46], [48], [51], [53], [58], [59], [60], [61], [62], [64], [65], [66] [2019-09-09 05:36:21,820 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:36:21,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:36:21,894 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:36:21,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:36:21,967 INFO L272 AbstractInterpreter]: Visited 22 different actions 80 times. Merged at 8 different actions 33 times. Widened at 2 different actions 5 times. Performed 143 root evaluator evaluations with a maximum evaluation depth of 11. Performed 143 inverse root evaluator evaluations with a maximum inverse evaluation depth of 11. Found 11 fixpoints after 5 different actions. Largest state had 5 variables. [2019-09-09 05:36:21,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:21,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:36:21,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:21,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:36:21,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:21,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:36:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:22,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-09 05:36:22,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:36:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:22,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:36:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:29,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:36:29,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-09 05:36:29,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:36:29,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 05:36:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 05:36:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:36:29,999 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 11 states. [2019-09-09 05:36:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:30,205 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2019-09-09 05:36:30,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:36:30,206 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-09-09 05:36:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:30,207 INFO L225 Difference]: With dead ends: 38 [2019-09-09 05:36:30,207 INFO L226 Difference]: Without dead ends: 31 [2019-09-09 05:36:30,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-09-09 05:36:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-09 05:36:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-09 05:36:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-09 05:36:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-09 05:36:30,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 23 [2019-09-09 05:36:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:30,213 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-09 05:36:30,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 05:36:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-09 05:36:30,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:36:30,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:30,215 INFO L399 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] [2019-09-09 05:36:30,215 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:30,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash -849280247, now seen corresponding path program 2 times [2019-09-09 05:36:30,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:30,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:30,225 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:36:30,225 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:36:30,226 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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 [2019-09-09 05:36:30,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:36:30,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:36:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:30,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:36:30,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:36:30,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:30,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:36:30,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:36:30,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 05:36:30,325 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-09 05:36:30,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:36:30,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-09 05:36:30,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:36:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:30,438 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:36:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:35,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:36:35,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-09 05:36:35,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:36:35,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-09 05:36:35,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-09 05:36:35,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=140, Unknown=2, NotChecked=0, Total=182 [2019-09-09 05:36:35,663 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 14 states. [2019-09-09 05:36:35,944 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-09-09 05:36:38,401 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~y~0_BEFORE_CALL_8 Int) (v_main_~x~0_BEFORE_CALL_8 Int)) (or (exists ((|v_gcd_test_#in~a_17| Int)) (and (<= (+ (div (+ |v_gcd_test_#in~a_17| (- 1)) 3) 1) v_main_~y~0_BEFORE_CALL_8) (<= v_main_~x~0_BEFORE_CALL_8 |v_gcd_test_#in~a_17|))) (< |c_gcd_test_#in~a| v_main_~x~0_BEFORE_CALL_8) (< v_main_~y~0_BEFORE_CALL_8 |c_gcd_test_#in~b|))) (<= (div (+ (- c_gcd_test_~b) (- |c_gcd_test_#in~a|)) (- 3)) |c_gcd_test_#in~b|) (exists ((gcd_test_~b Int)) (and (<= 0 gcd_test_~b) (<= (div (+ (- gcd_test_~b) (- |c_gcd_test_#in~a|)) (- 3)) |c_gcd_test_#in~b|)))) is different from false [2019-09-09 05:36:38,676 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-09-09 05:37:01,359 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_main_~y~0_BEFORE_CALL_8 Int) (v_main_~x~0_BEFORE_CALL_8 Int)) (or (exists ((|v_gcd_test_#in~a_17| Int)) (and (<= (+ (div (+ |v_gcd_test_#in~a_17| (- 1)) 3) 1) v_main_~y~0_BEFORE_CALL_8) (<= v_main_~x~0_BEFORE_CALL_8 |v_gcd_test_#in~a_17|))) (< |c_gcd_test_#in~a| v_main_~x~0_BEFORE_CALL_8) (< v_main_~y~0_BEFORE_CALL_8 |c_gcd_test_#in~b|))) (exists ((gcd_test_~b Int)) (and (<= 0 gcd_test_~b) (<= (div (+ (- gcd_test_~b) (- |c_gcd_test_#in~a|)) (- 3)) |c_gcd_test_#in~b|)))) is different from false [2019-09-09 05:37:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:37:11,189 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-09-09 05:37:11,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 05:37:11,192 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-09-09 05:37:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:37:11,195 INFO L225 Difference]: With dead ends: 46 [2019-09-09 05:37:11,196 INFO L226 Difference]: Without dead ends: 43 [2019-09-09 05:37:11,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=85, Invalid=261, Unknown=4, NotChecked=70, Total=420 [2019-09-09 05:37:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-09 05:37:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-09-09 05:37:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-09 05:37:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-09-09 05:37:11,211 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 25 [2019-09-09 05:37:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:37:11,212 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-09-09 05:37:11,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-09 05:37:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-09-09 05:37:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:37:11,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:37:11,213 INFO L399 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] [2019-09-09 05:37:11,213 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:37:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:37:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash -516331098, now seen corresponding path program 3 times [2019-09-09 05:37:11,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:37:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:37:11,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:37:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:37:11,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:37:11,237 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:37:11,237 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:37:11,237 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:37:11,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:37:11,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:37:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:37:11,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:37:11,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:37:11,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:37:11,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:37:11,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:37:11,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-09 05:37:11,315 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:37:11,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:37:11,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-09 05:37:11,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:37:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:37:11,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:37:26,230 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-09 05:37:28,512 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 24 [2019-09-09 05:37:29,014 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-09-09 05:37:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:37:29,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:37:29,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-09-09 05:37:29,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:37:29,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-09 05:37:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-09 05:37:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=188, Unknown=5, NotChecked=0, Total=240 [2019-09-09 05:37:29,058 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 16 states. [2019-09-09 05:37:31,292 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-09 05:37:31,543 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-09-09 05:37:41,279 WARN L188 SmtUtils]: Spent 9.37 s on a formula simplification. DAG size of input: 41 DAG size of output: 14 [2019-09-09 05:37:44,016 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((gcd_test_~b Int)) (and (<= gcd_test_~b 0) (<= |c_gcd_test_#in~b| (div (+ gcd_test_~b |c_gcd_test_#in~a|) 4)))) (<= |c_gcd_test_#in~b| (div (+ c_gcd_test_~b |c_gcd_test_#in~a|) 4)) (forall ((v_main_~x~0_BEFORE_CALL_10 Int) (v_main_~y~0_BEFORE_CALL_10 Int)) (or (exists ((v_gcd_test_~a_66 Int)) (and (<= (+ v_main_~y~0_BEFORE_CALL_10 1) (div (+ (* (- 1) v_main_~x~0_BEFORE_CALL_10) v_gcd_test_~a_66 (- 1)) (- 3))) (<= v_main_~y~0_BEFORE_CALL_10 v_gcd_test_~a_66))) (< v_main_~x~0_BEFORE_CALL_10 |c_gcd_test_#in~a|) (< |c_gcd_test_#in~b| v_main_~y~0_BEFORE_CALL_10)))) is different from false [2019-09-09 05:37:48,819 WARN L188 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-09-09 05:37:55,207 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2019-09-09 05:39:12,435 WARN L188 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-09-09 05:39:22,693 WARN L188 SmtUtils]: Spent 9.29 s on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-09-09 05:39:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:39:37,952 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2019-09-09 05:39:38,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-09 05:39:38,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2019-09-09 05:39:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:39:38,388 INFO L225 Difference]: With dead ends: 61 [2019-09-09 05:39:38,388 INFO L226 Difference]: Without dead ends: 57 [2019-09-09 05:39:38,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 80.0s TimeCoverageRelationStatistics Valid=119, Invalid=431, Unknown=6, NotChecked=44, Total=600 [2019-09-09 05:39:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-09 05:39:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2019-09-09 05:39:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-09 05:39:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2019-09-09 05:39:38,398 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 27 [2019-09-09 05:39:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:39:38,400 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2019-09-09 05:39:38,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-09 05:39:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2019-09-09 05:39:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:39:38,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:39:38,402 INFO L399 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] [2019-09-09 05:39:38,402 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:39:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:39:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash 134861350, now seen corresponding path program 4 times [2019-09-09 05:39:38,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:39:38,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:38,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:39:38,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:38,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:39:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:39:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-09 05:39:38,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:39:38,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:39:38,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:39:38,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:39:38,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:39:38,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:39:38,600 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand 3 states. [2019-09-09 05:39:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:39:38,617 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-09-09 05:39:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:39:38,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:39:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:39:38,626 INFO L225 Difference]: With dead ends: 53 [2019-09-09 05:39:38,626 INFO L226 Difference]: Without dead ends: 53 [2019-09-09 05:39:38,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:39:38,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-09 05:39:38,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-09-09 05:39:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-09 05:39:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-09-09 05:39:38,640 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 27 [2019-09-09 05:39:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:39:38,640 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-09-09 05:39:38,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:39:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-09-09 05:39:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:39:38,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:39:38,644 INFO L399 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] [2019-09-09 05:39:38,644 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:39:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:39:38,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1878386625, now seen corresponding path program 5 times [2019-09-09 05:39:38,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:39:38,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:38,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:39:38,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:39:38,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:39:38,665 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:39:38,665 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:39:38,665 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:39:38,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:39:38,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:39:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:39:38,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:39:38,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:39:38,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:39:38,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:39:38,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-09 05:39:38,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-09 05:39:38,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-09 05:39:38,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:39:38,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-09 05:39:38,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:39:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:39:38,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:39:39,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:39:43,040 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-09-09 05:39:53,736 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 22 [2019-09-09 05:39:55,805 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-09 05:39:58,427 WARN L188 SmtUtils]: Spent 2.58 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-09 05:40:04,577 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-09 05:40:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-09 05:40:04,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:40:04,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-09 05:40:04,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:40:04,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-09 05:40:04,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-09 05:40:04,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=402, Unknown=5, NotChecked=0, Total=462 [2019-09-09 05:40:04,618 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 22 states. [2019-09-09 05:40:05,285 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-09-09 05:40:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:40:07,860 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2019-09-09 05:40:07,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-09 05:40:07,860 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-09-09 05:40:07,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:40:07,861 INFO L225 Difference]: With dead ends: 76 [2019-09-09 05:40:07,861 INFO L226 Difference]: Without dead ends: 65 [2019-09-09 05:40:07,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=100, Invalid=707, Unknown=5, NotChecked=0, Total=812 [2019-09-09 05:40:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-09 05:40:07,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2019-09-09 05:40:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-09 05:40:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2019-09-09 05:40:07,868 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 29 [2019-09-09 05:40:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:40:07,869 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2019-09-09 05:40:07,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-09 05:40:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2019-09-09 05:40:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:40:07,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:40:07,870 INFO L399 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] [2019-09-09 05:40:07,870 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:40:07,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:40:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash 841482334, now seen corresponding path program 6 times [2019-09-09 05:40:07,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:40:07,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:40:07,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:40:07,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:40:07,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:40:07,879 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:40:07,880 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:40:07,880 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:40:07,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-09 05:40:07,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:40:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:40:07,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-09 05:40:07,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:40:07,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:40:07,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:40:07,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-09 05:40:07,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:40:07,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-09 05:40:07,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-09 05:40:07,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-09 05:40:07,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:40:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:40:08,229 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:40:29,028 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-09-09 05:40:35,344 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 36 [2019-09-09 05:40:43,103 WARN L188 SmtUtils]: Spent 2.34 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-09 05:40:53,565 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 39 [2019-09-09 05:41:04,183 WARN L188 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-09 05:41:06,262 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_main_~y~0_BEFORE_CALL_14 Int) (v_main_~x~0_BEFORE_CALL_15 Int)) (or (< |c_gcd_test_#in~b| v_main_~y~0_BEFORE_CALL_14) (exists ((v_gcd_test_~b_83 Int) (v_gcd_test_~a_99 Int) (v_gcd_test_~a_98 Int)) (let ((.cse0 (+ v_main_~y~0_BEFORE_CALL_14 1))) (and (<= (+ v_main_~y~0_BEFORE_CALL_14 v_gcd_test_~a_98) v_main_~x~0_BEFORE_CALL_15) (<= v_gcd_test_~b_83 0) (<= .cse0 (div (+ (+ (- v_gcd_test_~b_83) (* (- 3) v_gcd_test_~a_99)) (- 1)) (- 2))) (<= .cse0 (div (+ (+ v_gcd_test_~a_99 (- v_gcd_test_~a_98)) (- 1)) (- 2)))))) (< v_main_~x~0_BEFORE_CALL_15 |c_gcd_test_#in~a|))) (forall ((v_gcd_test_~a_104 Int)) (or (< c_gcd_test_~a (+ v_gcd_test_~a_104 c_gcd_test_~b)) (< (+ v_gcd_test_~a_104 (div (+ (* (- 1) v_gcd_test_~a_104) (- 1)) (- 2))) (+ c_gcd_test_~b 1))))) is different from false [2019-09-09 05:41:08,641 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_gcd_test_~a_104 Int)) (or (< c_gcd_test_~a (+ v_gcd_test_~a_104 (* 2 c_gcd_test_~b))) (< (+ v_gcd_test_~a_104 (div (+ (* (- 1) v_gcd_test_~a_104) (- 1)) (- 2))) (+ c_gcd_test_~b 1)))) (forall ((v_main_~y~0_BEFORE_CALL_14 Int) (v_main_~x~0_BEFORE_CALL_15 Int)) (or (< |c_gcd_test_#in~b| v_main_~y~0_BEFORE_CALL_14) (exists ((v_gcd_test_~b_83 Int) (v_gcd_test_~a_99 Int) (v_gcd_test_~a_98 Int)) (let ((.cse0 (+ v_main_~y~0_BEFORE_CALL_14 1))) (and (<= (+ v_main_~y~0_BEFORE_CALL_14 v_gcd_test_~a_98) v_main_~x~0_BEFORE_CALL_15) (<= v_gcd_test_~b_83 0) (<= .cse0 (div (+ (+ (- v_gcd_test_~b_83) (* (- 3) v_gcd_test_~a_99)) (- 1)) (- 2))) (<= .cse0 (div (+ (+ v_gcd_test_~a_99 (- v_gcd_test_~a_98)) (- 1)) (- 2)))))) (< v_main_~x~0_BEFORE_CALL_15 |c_gcd_test_#in~a|)))) is different from false [2019-09-09 05:41:11,138 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_gcd_test_~a_104 Int)) (or (< c_gcd_test_~a (+ v_gcd_test_~a_104 (* 3 c_gcd_test_~b))) (< (+ v_gcd_test_~a_104 (div (+ (* (- 1) v_gcd_test_~a_104) (- 1)) (- 2))) (+ c_gcd_test_~b 1)))) (forall ((v_main_~y~0_BEFORE_CALL_14 Int) (v_main_~x~0_BEFORE_CALL_15 Int)) (or (< |c_gcd_test_#in~b| v_main_~y~0_BEFORE_CALL_14) (exists ((v_gcd_test_~b_83 Int) (v_gcd_test_~a_99 Int) (v_gcd_test_~a_98 Int)) (let ((.cse0 (+ v_main_~y~0_BEFORE_CALL_14 1))) (and (<= (+ v_main_~y~0_BEFORE_CALL_14 v_gcd_test_~a_98) v_main_~x~0_BEFORE_CALL_15) (<= v_gcd_test_~b_83 0) (<= .cse0 (div (+ (+ (- v_gcd_test_~b_83) (* (- 3) v_gcd_test_~a_99)) (- 1)) (- 2))) (<= .cse0 (div (+ (+ v_gcd_test_~a_99 (- v_gcd_test_~a_98)) (- 1)) (- 2)))))) (< v_main_~x~0_BEFORE_CALL_15 |c_gcd_test_#in~a|)))) is different from false [2019-09-09 05:41:13,263 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_main_~y~0_BEFORE_CALL_14 Int) (v_main_~x~0_BEFORE_CALL_15 Int)) (or (< |c_gcd_test_#in~b| v_main_~y~0_BEFORE_CALL_14) (exists ((v_gcd_test_~b_83 Int) (v_gcd_test_~a_99 Int) (v_gcd_test_~a_98 Int)) (let ((.cse0 (+ v_main_~y~0_BEFORE_CALL_14 1))) (and (<= (+ v_main_~y~0_BEFORE_CALL_14 v_gcd_test_~a_98) v_main_~x~0_BEFORE_CALL_15) (<= v_gcd_test_~b_83 0) (<= .cse0 (div (+ (+ (- v_gcd_test_~b_83) (* (- 3) v_gcd_test_~a_99)) (- 1)) (- 2))) (<= .cse0 (div (+ (+ v_gcd_test_~a_99 (- v_gcd_test_~a_98)) (- 1)) (- 2)))))) (< v_main_~x~0_BEFORE_CALL_15 |c_gcd_test_#in~a|))) (forall ((v_gcd_test_~a_104 Int) (v_gcd_test_~a_107 Int)) (let ((.cse1 (+ |c_gcd_test_#in~b| 1))) (or (< (div (+ (+ v_gcd_test_~a_104 (- v_gcd_test_~a_107)) (- 1)) (- 3)) .cse1) (< (+ v_gcd_test_~a_104 (div (+ (* (- 1) v_gcd_test_~a_104) (- 1)) (- 2))) .cse1) (< |c_gcd_test_#in~a| v_gcd_test_~a_107))))) is different from true [2019-09-09 05:41:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (20)] Exception during sending of exit command (exit): Broken pipe [2019-09-09 05:41:13,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:41:13,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-09-09 05:41:13,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:41:13,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-09 05:41:13,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-09 05:41:13,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=217, Unknown=25, NotChecked=132, Total=420 [2019-09-09 05:41:13,290 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand 21 states. [2019-09-09 05:41:49,102 WARN L188 SmtUtils]: Spent 15.47 s on a formula simplification that was a NOOP. DAG size: 52 [2019-09-09 05:43:18,353 WARN L188 SmtUtils]: Spent 7.48 s on a formula simplification. DAG size of input: 53 DAG size of output: 8 [2019-09-09 05:44:07,852 WARN L188 SmtUtils]: Spent 22.69 s on a formula simplification that was a NOOP. DAG size: 55 [2019-09-09 05:45:14,301 WARN L188 SmtUtils]: Spent 34.36 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-09 05:45:36,813 WARN L188 SmtUtils]: Spent 15.72 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-09 05:46:11,384 WARN L188 SmtUtils]: Spent 6.47 s on a formula simplification that was a NOOP. DAG size: 45 [2019-09-09 05:46:34,542 WARN L188 SmtUtils]: Spent 8.49 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-09 05:47:11,900 WARN L188 SmtUtils]: Spent 20.03 s on a formula simplification that was a NOOP. DAG size: 60 [2019-09-09 05:48:02,645 WARN L188 SmtUtils]: Spent 10.67 s on a formula simplification that was a NOOP. DAG size: 54 [2019-09-09 05:48:25,396 WARN L188 SmtUtils]: Spent 8.45 s on a formula simplification that was a NOOP. DAG size: 50 [2019-09-09 05:49:20,694 WARN L188 SmtUtils]: Spent 12.65 s on a formula simplification that was a NOOP. DAG size: 53 [2019-09-09 05:50:48,584 WARN L188 SmtUtils]: Spent 32.66 s on a formula simplification that was a NOOP. DAG size: 57